Concurrency in extendible hashing (Q1108823)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Concurrency in extendible hashing |
scientific article |
Statements
Concurrency in extendible hashing (English)
0 references
1988
0 references
Hashing has long been recognized as a fast method for accessing records by key in large relatively static databases. However, when the amount of data is likely to grow significantly, traditional hashing suffers from performance degradation and may eventually require rehashing all the records into a larger space. Recently, a number of techniques for dynamic hashing have appeared. In this paper, we present a solution to allow for concurrency in one of these dynamic data structures, namely extendible hashfiles. The solution is based on locking protocols and minor modifications in the data structure.
0 references
concurrent algorithms
0 references
concurrency control
0 references
databases
0 references
dynamic hashing
0 references
data structures
0 references
locking
0 references