![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Log-based middleware server recovery with transaction support
Providing enterprises with reliable and available Web-based application programs is a challenge. Applications are traditionally spread over multiple nodes, from user (client), to middle tier servers, to back e...
-
Chapter and Conference Paper
The hB-pi* Tree: An Optimized Comprehensive Access Method for Frequent-Update Multi-dimensional Point Data
The R-tree [7] family is the most popular multi-dimensional index method. The R-tree, however, has overlaps among index entries and its index page fanout decreases rapidly as data dimension increases. Furtherm...
-
Chapter and Conference Paper
A Framework for Access Methods for Versioned Data
This paper presents a framework for understanding and constructing access methods for versioned data. Records are associated with version ranges in a version tree. A minimal representation for the end set of a...
-
Article
A Database System to Advance Subsurface Sensing and Imaging
The CenSSIS Image Database System is a scientific database that enables effective collaboration, scientific data sharing and accelerates fundamental research. We describe a state-of-the-art system that uses th...
-
Chapter and Conference Paper
The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure
There are applications which require the support of temporal data with branched time evolution, called branched-and-temporal data. In a branched-and-temporal database, both historic versions and current versions...
-
Chapter and Conference Paper
On Spatial-Range Closest-Pair Query
An important query for spatial database research is to find the closest pair of objects in a given space. Existing work assumes two objects of the closest pair come from two different data sets indexed by R-tr...
-
Article
Concurrency and recovery for index trees
Although many suggestions have been made for concurrency in B \(^+\) -trees, few of these have considered recovery as well. We describe an approach which provides high concurrenc...
-
Article
The hB \(^\Pi\) -tree: a multi-attribute index supporting concurrency, recovery and node consolidation
We propose a new multi-attribute index. Our approach combines the hB-tree, a multi-attribute index, and the \(\Pi\) -tree, an abstract index which offers efficient concurrency an...
-
Article
Merging sorted runs using large main memory
External sorting is usually accomplished by first creating sorted runs, then merging the runs. In the merge phase, writing and calculating can be overlapped by reading if two input buffers are used for each so...
-
Article
Buildings and shadows
This is an expository paper describing geometries associated to the groups of Lie type, following Jacques Tits' theory of buildings and his earlier theory of shadows. The geometry of shadows in the case of the...