Limitations of concurrency in transaction processing
ACM Transactions on Database Systems (TODS)
Operation specific locking in B-trees
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Utilization of B-trees with inserts, deletes and modifies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the sixteenth international conference on Very large databases
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Compensation-based on-line query processing
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
On-line processing in large-scale transaction systems
On-line processing in large-scale transaction systems
A framework for the performance analysis of concurrent B-tree algorithms
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Semantically-based concurrancy control for search structures
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrent operations on B-trees with overtaking
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
ACM Computing Surveys (CSUR)
The implementation of an integrated concurrency control and recovery scheme
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Concurrent algorithms for search structures (parallel, database)
Concurrent algorithms for search structures (parallel, database)
A mean value performance model for locking in databases
A mean value performance model for locking in databases
The performance of concurrent data structure algorithms
The performance of concurrent data structure algorithms
Quantitative evaluation of a transaction facility for knowledge base management system
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Restructuring the concurrent B+-tree with non-blocked search operations
Information Sciences—Informatics and Computer Science: An International Journal
A Restructuring Method for the Concurrent B+-Tree Based on Semantic Consistency
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
Concurrency control and recovery for balanced B-link trees
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
B-trees, shadowing, and clones
ACM Transactions on Storage (TOS)
WSEAS Transactions on Computers
Online reorganization of databases
ACM Computing Surveys (CSUR)
A concurrency control algorithm for nearest neighbor query
Information Sciences: an International Journal
A concurrent Blink-tree algorithm using a cooperative locking protocol
BNCOD'03 Proceedings of the 20th British national conference on Databases
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
NEFOS: rapid cache-aware range query processing with probabilistic guarantees
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
ISB-tree: a new indexing scheme with efficient expected behaviour
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
A number of algorithms have been proposed to access B+-trees concurrently, but they are not well understood. In this article, we study the performance of various B+-tree concurrency control algorithms using a detailed simulation model of B+-tree operations in a centralized DBMS. Our study covers a wide range of data contention situations and resource conditions. In addition, based on the performance of the set of B+-tree concurrency control algorithms, which includes one new algorithm, we make projections regarding the performance of other algorithms in the literature. Our results indicate that algorithms with updaters that lock-couple using exclusive locks perform poorly as compared to those that permit more optimistic index descents. In particular, the B-link algorithms are seen to provide the most concurrency and the best overall performance. Finally, we demonstrate the need for a highly concurrent long-term lock holding strategy to obtain the full benefits of a highly concurrent algorithm for index operations.