Name
Abstract | ||
|---|---|---|
Balanced structures, variations of B-trees, have been used as an access aid for both primary and secondary indexing for quite some time. This paper presents a deadlock-free locking mechanism for B-trees in which different processes make use of different lock types in order to reach the leaf nodes. The compatibility relations among locks on a node do not exclusively depend on their type, but also on the node status and the number and kind of processes acting currently on the node. As a result, a number of insertion or deletion processes can operate concurrently on a node. The paper presents an appropriate recovery strategy in case of failure and discusses the protocol modifications that are required so it can be used in other similar structures such as B+-trees, compressed B-trees, and R-trees for spatial searching. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1016/0020-0255(89)90035-2 | Inf. Sci. |
Keywords | Field | DocType |
balanced structure | Data structure,Tree (graph theory),Concurrency control,Compatibility (mechanics),Lock (computer science),Computer science,Search engine indexing,Distributed computing | Journal |
Volume | Issue | ISSN |
48 | 1 | 0020-0255 |
Citations | PageRank | References |
5 | 0.45 | 25 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandros Biliris | 1 | 407 | 197.90 |