Advertisement

Dynamic external hashing with guaranteed single access retrieval

  • M. V. Ramakrishna
  • Walid R. Tout
Basic Data Structures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 367)

Abstract

The goal of the research on hashing as an access method is to arrive at a simple file organization scheme which guarantees single access retrieval from secondary storage, and is dynamic (can gracefully accommodate varying file sizes). There has been much progress in recent years in this regard. The Signature Hashing scheme for external files, proposed by Gonnet and Larson, guarantees single access retrieval [GL88]. But the scheme is static and implementation is complicated [LK84]. In this paper a simple external hashing scheme which guarantees single access retrieval is proposed and performance investigated. The scheme is dynamic, and its cost is better than that of Signature Hashing. An overview of the current state of the art and open problems are mentioned.

Keywords

Load Factor Internal Memory High Load Factor Single Access File Organization 
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. [CW79]
    Carter, L.J. and Wegman, M.L. Universal classes of hash functions. Journal of Computer and System Sciences, 18,2(1979), 143–154.Google Scholar
  2. [FN79]
    Fagin, R., Nievergelt, J., Pippenger, N. and Strong, H.R. Extendible hashing — a fast access method for dynamic files. ACM Trans. on Database Systems, 4, 3(1979), 315–344.Google Scholar
  3. [GL82]
    Gonnet, G. H., and Larson, P. A. External hashing with limited internal storage. In Proceedings of the ACM Symposium on Principles of Database Systems (Los Angeles, CA.), ACM, New York, 1982, pp. 256–261.Google Scholar
  4. [GL88]
    Gonnet, G. H., and Larson P. A. External hashing with limited internal storage. Journal of the ACM, 35, 1 (1988), pp. 161–184.Google Scholar
  5. [GN81]
    Gonnet, G.H. Expected length of the longest probe sequence in hash code searching. Journal of the ACM, 28, 2(1981), 289–304.Google Scholar
  6. [LK84]
    Larson, P.-A. and Kajla, A. File organization — implementation of a method guaranteeing retrieval in one access. Comm. of the ACM, 27,7 (1984), 670–677.Google Scholar
  7. [LL86]
    Litwin, W. and Lomet, D.B. The bounded disorder access method, Proc. 2nd Intn'l Conference on Data Engineering (Los Angeles, CA, 1988), 38–48.Google Scholar
  8. [LR83]
    Larson, P.-A. Analysis of uniform hashing. Journal of the ACM, 30, 4 (1983), 805–819.Google Scholar
  9. [LR88]
    Larson, P.A., Dynamic Hash Tables Comm. of the ACM, 31, 4 (1988), 446–457.Google Scholar
  10. [LS88]
    Larson, P. A., Linear Hashing with Separators-A Dynamic Hashing Scheme Achieving One-Access Retrieval. ACM Transactions on Database Systems, 13, 3 (1988), 366–388.Google Scholar
  11. [LT80]
    Litwin,W. Linear hashing: A new tool for files and tables addressing. Proc. 6th Intern'l Conf. on Very Large Databases, (Montreal, 1980), 212–223.Google Scholar
  12. [MR83]
    Mairson,H.G. The program complexity of searching a table. Proc. 24th Symposium on Foundations of Computer Science, IEEE Computer Society, 1983, 40–47.Google Scholar
  13. [MR84]
    Mairson,H.G. The program complexity of searching a table. Ph.D. Thesis, Department of Computer Science, Stanford University, 1984.Google Scholar
  14. [RL88]
    Ramakrishna, M.V. and Larson, P.A. File organization using composite perfect hashing. (to appear) ACM Trans. on Database Systems. Earlier version in Proc. ACM-SIGMOD Intern'l Conf. on Management of Data, (Austin, 1985), 190–200.Google Scholar
  15. [RM86]
    Ramakrishna,M.V. Perfect hashing for external files. Ph.D. Thesis, Department of Computer Science, University of Waterloo, Research Report CS-86-25, 1986.Google Scholar
  16. [RM88]
    Ramakrishna, M.V. Hashing in practice, analysis of hashing and universal hashing. Proc. ACM-SIGMOD Intern'l Conf. on Management of Data, (Chicago, 1988), 191–200.Google Scholar
  17. [SP77]
    Sprugnoli, R.J. Perfect hashing functions: A single probe retrieving method for static sets. Comm. of the ACM, 20, 11 (1977), 841–850.Google Scholar
  18. [TH88]
    Tharp, A.L. File Organization and Processing. New York: John Wiley, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • M. V. Ramakrishna
    • 1
  • Walid R. Tout
    • 1
  1. 1.Computer Science DepartmentMichigan State UniversityEast Lansing

Personalised recommendations