Concurrency and linear hashing
Carla Schlatter Ellis · 1985
AbstmctHashing 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 linear hash tiles that is based .onlocking protocols and minor modifications in the data structure.The problem .ofadapting this technique for use in a distributed system is also addressed.