The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
The reallocation of hash-coded tables
Communications of the ACM
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
File structures using hashing functions
Communications of the ACM
Communications of the ACM
Multi-attribute inverted files implemented with hashing
ACM-SE 15 Proceedings of the 15th annual Southeast regional conference
| Hi-index | 0.00 |
A study is presented of the behavior of hashing when implemented with variable-length entries in a hash area. Neither bucketing nor pointers are necessary to achieve the variability. Significant space savings may be realized by reducing the amount of space required for each entry while providing for entries of any length. Savings in time may also be realized by improving the locality of reference. Simulation results are presented which demonstrate the potential savings along with some interesting behavioral aspects of using a variable-length entry approach. Variability by a fixed block size as well as variability by atom is discussed. An algorithm to accomplish the placement of variable-length entries in the hash area is given.