This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Compact Hash Tables Using Bidirectional Linear Probing
September 1984 (vol. 33 no. 9)
pp. 828-834
J.G. Clerry, Man-Machine Systems Group, Department of Computer Science, The University of Calgary
An algorithm is developed which reduces the memory requirements of hash tables. This is achieved by storing only a part of each key along with a few extra bits needed to ensure that all keys are stored unambiguously. The fraction of each key stored decreases as the size of the hash table increases. Significant reductions in total memory usage can be achieved especially when the key size is not much larger than the size of a memory index and when only a small amount of data is stored with each key. The algorithm is based on bidirectional linear probing. Search and insertion times are shown by simulation to be similar to those for ordinary bidirectional linear probing.
Index Terms:
searchfing, Address calculation, bidirectional linear probing, hash storage, information retrieval, memory compaction, open addressing, performance analysis, scatter storage
Citation:
J.G. Clerry, "Compact Hash Tables Using Bidirectional Linear Probing," IEEE Transactions on Computers, vol. 33, no. 9, pp. 828-834, Sept. 1984, doi:10.1109/TC.1984.1676499
Usage of this product signifies your acceptance of the Terms of Use.