Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/a-survey-of-b-tree-locking-techniques-Vnm0jDuN7P
References (38)
-
Yang Ni, Vijay Menon, Ali-Reza Adl-Tabatabai, Antony Hosking, Richard Hudson, J. Moss, Bratin Saha, T. Shpeisman (2007)
Open nesting in software transactional memoryProceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
-
C. Mohan, F. Levine (1992)
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging -
J. Moss (2006)
Open Nested Transactions: Semantics and Support -
R. Bayer, K. Unterauer (1977)
Prefix B-treesACM Trans. Database Syst., 2
-
P. Lehman, Bing Yao (1981)
Efficient locking for concurrent operations on B-treesACM Trans. Database Syst., 6
-
I. Jaluta, S. Sippu, E. Soisalon-Soininen (2005)
Concurrency control and recovery for balanced B-link treesThe VLDB Journal, 14
-
G. Weikum, Gottfried Vossen (2001)
Transactional information systems: theory, algorithms, and the practice of concurrency control and recoverySIGMOD Rec., 30
-
Chendong Zou, B. Salzberg (1996)
On-line reorganization of sparsely-populated B+-trees, 25
-
R. Bayer, E. McCreight (1970)
Organization and maintenance of large ordered indicesActa Informatica, 1
-
Douglas Comer (1979)
Ubiquitous B-TreeACM Comput. Surv., 11
-
H. Korth (1983)
Locking Primitives in a Database SystemJ. ACM, 30
-
G. Weikum (1991)
Principles and realization strategies of multilevel transaction managementACM Trans. Database Syst., 16
-
R. Bayer (1997)
The Universal B-Tree for Multidimensional Indexing: general Concepts -
J. Larus, Ravi Rajwar (2007)
Transactional MemorySynthesis Lectures on Computer Architecture
-
C. Mohan (1990)
ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes -
Frank Ramsak, V. Markl, R. Fenk, Martin Zirkel, Klaus Elhardt, R. Bayer (2000)
Integrating the UB-Tree into a Database System Kernel -
(2009)
Received September -
G. Graefe (2007)
Hierarchical locking in B-tree indexes -
V. Srinivasan, M. Carey (1991)
Performance of B-Tree Concurrency Algorithms -
R. Bayer, E. McCreight (1972)
Organization and maintenance of large ordered indexesActa Informatica, 1
-
G. Graefe, M. Zwilling (2004)
Transaction support for indexed views. -
G. Weikum (2002)
CHAPTER FOUR – Concurrency Control Algorithms -
P. O'Neil (1986)
The Escrow transactional methodACM Trans. Database Syst., 11
-
Dan Suciu, G. Weikum (2005)
ACM Transactions on Database SystemsACM Transactions on Database Systems, 30
-
D. Lomet (1993)
Key Range Locking Strategies for Improved Concurrency -
G. Graefe, M. Zwilling (2004)
Transaction support for indexed summary views -
H. Kung, J. Robinson (1979)
On optimistic methods for concurrency control -
J. Larus, Ravi Rajwar (2007)
Transactional Memory (Synthesis Lectures on Computer Architecture) -
K. Eswaran, J. Gray, R. Lorie, I. Traiger (1976)
The notions of consistency and predicate locks in a database systemCommun. ACM, 19
-
R. Bayer, M. Schkolnick (1994)
Concurrency of operations on B-treesActa Informatica, 9
-
J. Gray, A. Reuter (1992)
Transaction Processing: Concepts and Techniques -
Gang Luo, J. Naughton, Curt Ellmann, M. Watzke (2003)
Locking protocols for materialized aggregate join viewsIEEE Transactions on Knowledge and Data Engineering, 17
-
D. Gawlick, D. Kinkade (1985)
Varieties of Concurrency Control in IMS/VS Fast Path.IEEE Data(base) Engineering Bulletin, 8
-
J. Jordan, J. Banerjee, R. Batman (1981)
Precision locks -
G. Weikum, H. Schek (1992)
Concepts and Applications of Multilevel Transactions and Open Nested Transactions -
V. Srinivasan, M. Carey (1991)
Performance of B-tree concurrency control algorithms, 20
-
(2010)
Article 16, Publication date -
D. Lomet (2004)
Simple, robust and highly concurrent b-trees with node deletionProceedings. 20th International Conference on Data Engineering
- Publisher
- Association for Computing Machinery
- Copyright
- The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
- Subject
- Concurrency
- ISSN
- 0362-5915
- DOI
- 10.1145/1806907.1806908
- Publisher site
- See Article on Publisher Site
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.
Journal
ACM Transactions on Database Systems (TODS) – Association for Computing Machinery
Published: Jul 1, 2010