Performance of B-tree concurrency control algorithms

Srinivasan, V.; Carey, Michael J.

doi:10.1145/119995.115860

Cited by 26 publications

(28 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Techniques that build on the B + -tree are capable of very good performance, and they offer ease of integration into real systems that do not support multidimensional structures such as the R-tree. Further, effective locking strategies are available for the B + -tree, which is important in concurrent environments [18]. Although similar strategies exist for the R-tree and its variants [12,13] complex index operations lock nodes for longer time, which adversely affects throughput [7,8].…”

Section: Index Structures For Moving Objectsmentioning

confidence: 99%

Effectively indexing uncertain moving objects for predictive queries

et al. 2009

View full text Add to dashboard Cite

Moving object indexing and query processing is a well studied research topic, with applications in areas such as intelligent transport systems and location-based services. While much existing work explicitly or implicitly assumes a deterministic object movement model, real-world objects often move in more complex and stochastic ways. This paper investigates the possibility of a marriage between moving-object indexing and probabilistic object modeling. Given the distributions of the current locations and velocities of moving objects, we devise an efficient inference method for the prediction of future locations. We demonstrate that such prediction can be seamlessly integrated into existing index structures designed for moving objects, thus improving the meaningfulness of range and nearest neighbor query results in highly dynamic and uncertain environments. The paper reports on extensive experiments on the Bx -tree that offer insights into the properties of the paper's proposal.

show abstract

Section: Index Structures For Moving Objectsmentioning

confidence: 99%

Effectively indexing uncertain moving objects for predictive queries

et al. 2009

View full text Add to dashboard Cite

show abstract

“…Thus, the internal nodes serve as a directory. In order to support B-link concurrency control [21], each internal node contains a pointer to its right sibling (the pointer is non-null if one exists). The leaf nodes contain the moving-object locations being indexed and corresponding index time.…”

Section: Index Structurementioning

confidence: 99%

“…We implemented the Rlink technique [8] for the TPR-tree and the B-link technique [21] for the B -tree.…”

Section: Effect Of Concurrent Accesses and Buffer Spacementioning

confidence: 99%

+Query and Update Efficient B-Tree Based Indexing of Moving Objects

Jensen

Lin

Ooi

2004

Proceedings 2004 VLDB Conference

227

148

View full text Add to dashboard Cite

A number of emerging applications of data management technology involve the monitoring and querying of large quantities of continuous variables, e.g., the positions of mobile service users, termed moving objects. In such applications, large quantities of state samples obtained via sensors are streamed to a database. Indexes for moving objects must support queries efficiently, but must also support frequent updates. Indexes based on minimum bounding regions (MBRs) such as the R-tree exhibit high concurrency overheads during node splitting, and each individual update is known to be quite costly. This motivates the design of a solution that enables the B § -tree to manage moving objects. We represent moving-object locations as vectors that are timestamped based on their update time. By applying a novel linearization technique to these values, it is possible to index the resulting values using a single B § -tree that partitions values according to their timestamp and otherwise preserves spatial proximity. We develop algorithms for range and¨nearest neighbor queries, as well as continuous queries. The proposal can be grafted into existing database systems cost effectively. An extensive experimental study explores the performance characteristics of the proposal and also shows that it is capable of substantially outperforming the R-tree based TPRtree for both single and concurrent access scenarios.

show abstract

“…All concurrency techniques that have appeared in the literature may be applied in our structure proposal. In this way, our structure may augment the set of techniques examined in [8] and [16].…”

Section: Basic Backgroundmentioning

confidence: 99%

B-trees with lazy parent split

Manolopoulos

1994

Information Sciences

View full text Add to dashboard Cite

A B-tree variant that postpones parent node splittings due to upcoming items until a later access of the same node is examined. This technique aims to decrease the possibility of propagating splittings to upper levels so that more concurrency is achieved. Insertion and deletion algorithms are given. Time and space performance results are also reported and comparison with conventional B-trees is carried out. It is shown that this technique substantially improves the performance of small degree B-trees so that, indeed, concurrency is enhanced.

show abstract

Performance of B-tree concurrency control algorithms

Cited by 26 publications

References 14 publications

Effectively indexing uncertain moving objects for predictive queries

Effectively indexing uncertain moving objects for predictive queries

+Query and Update Efficient B-Tree Based Indexing of Moving Objects

B-trees with lazy parent split

Contact Info

Product

Resources

About