Order preserving linear hashing using dynamic key statistics
John T. Robinson · 1985
A class or order preserving key associative access methods based cm linear hashing is presented.The overwhelming advantage of these methods for many applications is that sequential access is supported.In these methods, dynamically maintained key statistics are used at the beginning of each expansion to construct new order preserving hash functions that should be approximately uniform.An example of such a function using positional digram frequency statistics is given, and the results of an experiment using these methods is reported.