Concurrency in extendible hashing
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.
scientific article; zbMATH DE number 4068341