The quadratic quotient method: a hash code eliminating secondary clustering
Communications of the ACM
Communications of the ACM
Programming Technique: An improved hash code for scatter storage
Communications of the ACM
Communications of the ACM
Random access file organization for indirectly addressed records
ACM '69 Proceedings of the 1969 24th national conference
A compendium of key search references
ACM SIGIR Forum
Query-processing optimization strategies: feasible vs optimal solutions
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
Hi-index | 48.22 |
Clustering in the key set is decreased by smoothing the key-to-address transformation, and by adding shadow buckets to an open chaining file. The keys are pre-hashed before the address division, to remove the effect of sequential properties in the key set. Shadow buckets in the key search sequence reduce the effect of nonuniformity in file loading, and decrease the number of maximum probes needed to locate a record. The combined effects of these techniques lead to improved file performance for secondary storage devices, as shown by empirical studies.