Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
Concurrent search structure algorithms
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
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
MLR: a recovery method for multi-level systems
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
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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)
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
Process structuring, synchronization, and recovery using atomic actions
Proceedings of an ACM conference on Language design for reliable software
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A survey of B-tree locking techniques
ACM Transactions on Database Systems (TODS)
Foundations and Trends in Databases
Self-diagnosing and self-healing indexes
DBTest '12 Proceedings of the Fifth International Workshop on Testing Database Systems
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Why might B-tree concurrency control still beinteresting? For two reasons: (i) currentlyexploited "real world" approaches arecomplicated; (ii) simpler proposals are not usedbecause they are not sufficiently robust. In the"real world", systems need to deal robustly withnode deletion, and this is an important reasonwhy the currently exploited techniques arecomplicated. In our effort to simplify the worldof robust and highly concurrent B-tree methods,we focus on exactly where b-tree concurrencycontrol needs information about node deletes,and describe mechanisms that provide thatinformation. We exploit the Blink-tree property ofbeing "well-formed" even when index termposting for a node split has not been completedto greatly simplify our algorithms. Our goal is todescribe a very simple but nonetheless robustmethod.