Advertisement

Abstract

Filtered hashing is a new method of hashing that can maintain the benefits of hashing even when there are many overflow records. When an overflow occurs, a bucket is split into two and its address is stored in the overflow filter. When an underflow occurs, two buckets can be merged into one to reduce the file size. As long as the overflow filter fits in the main memory, the number of disk accesses to retrieve a record is guaranteed to be just one. The cost of inserting or deleting a record is also bounded by between 2 and 4 disk accesses. If the overflow filter grows too big due to excessive growth, the file can be reorganized with a bigger address space at a convenient time to achieve the optimal performance of static hashing, and can still adapt to dynamic changes later on.

Keywords

Hash Function Main Memory File Size Split Function Space Utilization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. Lum, P. Yuen, M. Dodd: Key-to address transform techniques: A fundamental performance study on large existing formatted files, Communications of ACM, Vol. 14, No. 4, Apr. 1971, pp. 228–239.Google Scholar
  2. 2.
    D. Severance, R. Duhne: A Practitioner's Guide to Addressing Algorithms, Communications of ACM, Vol. 19, No. 6, June 1976, pp. 314–326.Google Scholar
  3. 3.
    M. Ramakrishna: Hashing in Practice, Analysis of Hashing and Universal Hashing, ACM SIGMOD Record, Vol. 17, No. 3, Sep. 1988, pp. 191–199.Google Scholar
  4. 4.
    R. Enbody, H. Du: Dynamic Hashing Schemes, ACM Computing Surveys, Vol. 20, No. 2, June, 1988, pp. 85–113.Google Scholar
  5. 5.
    P. Larson: Dynamic Hashing, BIT, 18 (1978), pp. 184–201.Google Scholar
  6. 6.
    R. Fagin, J. Nievergelt, N. Pippenger, H. Strong: Extendible Hashing — A Fast Access Method for Dynamic Files, ACM Transactions on Database Systems, Vol. 4, No. 3, Sep. 1979, pp. 315–344.Google Scholar
  7. 7.
    H. Mendelson: Analysis of Extendible Hashing, IEEE Transactions on Software Engineering, Vol. 8, No. 6, Nov. 1982, pp. 611–619.Google Scholar
  8. 8.
    W. Litwin: Virtual Hashing: A Dynamically Changing Hashing, Proceedings of the Conference on Very Large Databases, 1978, pp. 517–523.Google Scholar
  9. 9.
    W. Litwin: Linear Hashing: A New Tool For File And Table Addressing, Proceedings of the Conference on Very Large Databases, 1980, pp. 212–223.Google Scholar
  10. 10.
    P. Larson: Linear Hashing with Partial Expansions, Proceedings of the Conference on Very Large Databases, 1980, pp. 224–232Google Scholar
  11. 11.
    P. Larson: Performance Analysis of Linear Hashing with Partial Expansions, ACM Transactions on Database Systems, Vol. 7, No. 4, Dec. 1982, pp. 566–587.Google Scholar
  12. 12.
    P. Larson: Linear Hashing with Overflow-Handling by Linear Probing, ACM Transactions on Database Systems, Vol. 10, No. 1, Mar. 1985, pp. 75–89.Google Scholar
  13. 13.
    K. Kawagoe: Modified Dynamic Hashing, Proceedings of ACM SIGMOD International Conference on Management of Data, May 1985, pp. 201–213.Google Scholar
  14. 14.
    J. Mullen: Unified Dynamic Hashing, Proceedings of the Conference on Very Large Databases, Aug. 1984, pp. 473–480.Google Scholar
  15. 15.
    K. Ramamohanarao, J. Lloyd: Dynamic Hashing Schemes, The Computer Journal, Vol. 25, No. 4, 1982, pp. 478–485.Google Scholar
  16. 16.
    K. Ramamohanarao, R. Sacks-Davis: Recursive Linear Hashing, ACM Transactions on Database Systems, Vol. 9, No. 3, Sep. 1984, pp. 369–391.Google Scholar
  17. 17.
    M. Scholl: New File Organizations Based on Dynamic Hashing, ACM Transactions on Database Systems, Vol. 6, No. 1, Mar. 1981, pp. 194–211.Google Scholar
  18. 18.
    E. Veklerov: Analysis of Dynamic Hashing with Deferred Splitting, ACM Transactions on Database Systems, Vol. 10, No. 1, Mar. 1985, pp. 90–96.Google Scholar
  19. 19.
    M. Ramakrishna, W. Tout: DDynamic External Hashing with Guaranteed Single Access Retrieval, Proceedings of the International Conference on Foundations of Data Organization and Algorithms, 1989, pp. 187–201.Google Scholar
  20. 20.
    P. Larson: Linear Hashing with Separators — A Dynamic Hashing Scheme Achieving One-Access Retrieval, ACM Transactions on Database Systems, Vol. 13, No. 3, Sep. 1988, pp. 366–388.Google Scholar
  21. 21.
    F. Cesarini, G. Soda: A Dynamic Hash Method with Signature, ACM Transactions on Database Systems, Vol. 16, No. 2, Jun. 1991, pp. 309–337.Google Scholar
  22. 22.
    R. Sprugnoli: Perfect hash functions: A single probe retrieving method for static sets, Communications of ACM, Vol. 20, No. 11, Nov. 1977, pp. 841–850Google Scholar
  23. 23.
    M. Ramakrishna, P. Larson: File Organization Using Composite Perfect Hashing, ACM Transactions on Database Systems, Vol. 14, No. 2, Jun. 1989, pp. 231–263.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Ilsoo Ahn
    • 1
  1. 1.AT&T Bell LaboratoriesColumbusUSA

Personalised recommendations