A survey of B-tree locking techniques
ACM Transactions on Database Systems · 2010-07 · 35 (3) · 1-26
DOI: 10.1145/1806907.1806908 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Database Systems, online erschienen am 30.07.2010. Verfasst von Goetz Graefe. Die Arbeit wurde bisher 94-mal zitiert (Crossref) und nennt 31 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Graefe, G. (2010). A survey of B-tree locking techniques. ACM Transactions on Database Systems, 35(3), 1-26. https://doi.org/10.1145/1806907.1806908
Vancouver
Graefe G. A survey of B-tree locking techniques. ACM Transactions on Database Systems. 2010;35(3):1-26. doi:10.1145/1806907.1806908
BibTeX
@article{Graefe2010,
author = {Graefe, Goetz},
title = {A survey of B-tree locking techniques},
journal = {ACM Transactions on Database Systems},
year = {2010},
volume = {35},
number = {3},
pages = {1--26},
doi = {10.1145/1806907.1806908}
}
EUVIMED