Affiliation:
1. Hewlett-Packard Laboratories, Palo Alto, CA
Abstract
B-trees have been ubiquitous in database management systems for several decades, and they are used in other storage systems as well. Their basic structure and basic operations are well and widely understood including search, insertion, and deletion. Concurrency control of operations in B-trees, however, is perceived as a difficult subject with many subtleties and special cases. The purpose of this survey is to clarify, simplify, and structure the topic of concurrency control in B-trees by dividing it into two subtopics and exploring each of them in depth.
Publisher
Association for Computing Machinery (ACM)
Reference31 articles.
1. Organization and maintenance of large ordered indexes
2. Concurrency of operations on B-trees
3. PrefixB-trees
4. Bernstein P. A. Hadzilacos V. and Goodman N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley. Bernstein P. A. Hadzilacos V. and Goodman N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley.
Cited by
80 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献