The theory of database concurrency control
The theory of database concurrency control
Concurrent operations on B*-trees with overtaking
Journal of Computer and System Sciences
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrency control in database structures with relaxed balance
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery methods for B+-tree indexes: ARIES/KVL and ARIES/IM
Performance of concurrency control mechanisms in centralized database systems
Garbage collection: algorithms for automatic dynamic memory management
Garbage collection: algorithms for automatic dynamic memory management
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Concurrency control in a dynamic search structure
ACM Transactions on Database Systems (TODS)
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)
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
A Distributed Data-Balanced Dictionary Based on the B-Link Tree
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Logical and Physical Versioning in Main Memory Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
High-Concurrency Locking in R-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
A unified approach to concurrent and parallel algorithms on balanced data structures
SCCC '97 Proceedings of the 17th International Conference of the Chilean Computer Science Society
The performance of concurrent data structure algorithms
The performance of concurrent data structure algorithms
Concurrency control and recovery for balanced B-link trees
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
We present new algorithms for concurrent reading and updating of B*-trees and binary search trees. Our algorithms are based on the well-known link technique, and improve previously proposed solutions in several respects. We prove formally that our algorithms are correct. We show that they satisfy a view serializability criterion, which fails for previous solutions. This stronger serializability criterion is central to the proof that several subtle (but essential) optimizations incorporated in our algorithms are correct.