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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
D. Severance, R. Duhne: A Practitioner's Guide to Addressing Algorithms, Communications of ACM, Vol. 19, No. 6, June 1976, pp. 314–326.
M. Ramakrishna: Hashing in Practice, Analysis of Hashing and Universal Hashing, ACM SIGMOD Record, Vol. 17, No. 3, Sep. 1988, pp. 191–199.
R. Enbody, H. Du: Dynamic Hashing Schemes, ACM Computing Surveys, Vol. 20, No. 2, June, 1988, pp. 85–113.
P. Larson: Dynamic Hashing, BIT, 18 (1978), pp. 184–201.
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.
H. Mendelson: Analysis of Extendible Hashing, IEEE Transactions on Software Engineering, Vol. 8, No. 6, Nov. 1982, pp. 611–619.
W. Litwin: Virtual Hashing: A Dynamically Changing Hashing, Proceedings of the Conference on Very Large Databases, 1978, pp. 517–523.
W. Litwin: Linear Hashing: A New Tool For File And Table Addressing, Proceedings of the Conference on Very Large Databases, 1980, pp. 212–223.
P. Larson: Linear Hashing with Partial Expansions, Proceedings of the Conference on Very Large Databases, 1980, pp. 224–232
P. Larson: Performance Analysis of Linear Hashing with Partial Expansions, ACM Transactions on Database Systems, Vol. 7, No. 4, Dec. 1982, pp. 566–587.
P. Larson: Linear Hashing with Overflow-Handling by Linear Probing, ACM Transactions on Database Systems, Vol. 10, No. 1, Mar. 1985, pp. 75–89.
K. Kawagoe: Modified Dynamic Hashing, Proceedings of ACM SIGMOD International Conference on Management of Data, May 1985, pp. 201–213.
J. Mullen: Unified Dynamic Hashing, Proceedings of the Conference on Very Large Databases, Aug. 1984, pp. 473–480.
K. Ramamohanarao, J. Lloyd: Dynamic Hashing Schemes, The Computer Journal, Vol. 25, No. 4, 1982, pp. 478–485.
K. Ramamohanarao, R. Sacks-Davis: Recursive Linear Hashing, ACM Transactions on Database Systems, Vol. 9, No. 3, Sep. 1984, pp. 369–391.
M. Scholl: New File Organizations Based on Dynamic Hashing, ACM Transactions on Database Systems, Vol. 6, No. 1, Mar. 1981, pp. 194–211.
E. Veklerov: Analysis of Dynamic Hashing with Deferred Splitting, ACM Transactions on Database Systems, Vol. 10, No. 1, Mar. 1985, pp. 90–96.
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.
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.
F. Cesarini, G. Soda: A Dynamic Hash Method with Signature, ACM Transactions on Database Systems, Vol. 16, No. 2, Jun. 1991, pp. 309–337.
R. Sprugnoli: Perfect hash functions: A single probe retrieving method for static sets, Communications of ACM, Vol. 20, No. 11, Nov. 1977, pp. 841–850
M. Ramakrishna, P. Larson: File Organization Using Composite Perfect Hashing, ACM Transactions on Database Systems, Vol. 14, No. 2, Jun. 1989, pp. 231–263.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, I. (1993). Filtered hashing. In: Lomet, D.B. (eds) Foundations of Data Organization and Algorithms. FODO 1993. Lecture Notes in Computer Science, vol 730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57301-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-57301-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57301-2
Online ISBN: 978-3-540-48047-1
eBook Packages: Springer Book Archive