Dynamic Hashing Schemes

89Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

Abstract

A new type of dynamic file access called dynamic hashing has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues. © 1988, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Enbody, R. J., & Du, H. C. (1988). Dynamic Hashing Schemes. ACM Computing Surveys (CSUR), 20(2), 85–113. https://doi.org/10.1145/46157.330532

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free