Abstract
The paper gives a survey of concurrent operations on B-trees and B-tree variants. Concurrent operations on B-trees can be synchronized using locking protocols, optimistic concurrency control, or integrated concurrency control algorithms. For concurrency control on B-trees, mostly locking protocols have been proposed. Different techniques for concurrent operations on B-trees are described and various proposed algorithms are compared.
| Translated title of the contribution | Locking mechanisms for B-Trees: A comparison |
|---|---|
| Original language | German (Austria) |
| Pages (from-to) | 183-200 |
| Number of pages | 18 |
| Journal | Informatik-Spektrum |
| Volume | 14 |
| Publication status | Published - 1991 |
Fields of science
- 102 Computer Sciences
- 102015 Information systems