Skip to main content
SpringerLink
Log in

Design and implementation of DDH: A distributed dynamic hashing algorithm

  • Conference paper
  • First Online:
Foundations of Data Organization and Algorithms (FODO 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 730))

Abstract

DDH extends the idea of dynamic hashing algorithms to distributed systems. DDH spreads data across multiple servers in a network using a novel autonomous location discovery algorithm that learns the bucket locations instead of using a centralized directory.

We describe the design and implementation of the basic DDH algorithm using networked computers. Performance results show that the prototype of DDH hashing is roughly equivalent to conventional single-node hashing implementations when compared with CPU time or elapsed time. Finally, possible improvements are suggested to the basic DDH algorithm for increased reliability and robustness.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AT&T, DBM(3X), Unix Programmer's Manual, System V.3, pp. 506–8, 1985.

    Google Scholar 

  2. Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, and H. Raymond Strong, “Extensible Hashing — A Fast Access Method for Dynamic Files”, ACM Transactions on Database Systems, Volume 4, No. 3, pp. 315–34, September 1979.

    Google Scholar 

  3. Richard Golding, “Accessing Replicated Data in a Large-Scale Distributed System”, University of California at Santa Cruz technical report, June 1991.

    Google Scholar 

  4. H.I.Hsiao and David DeWitt, “Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines”, Proceedings of the 6th International Conference on Data Engineering, February 1990.

    Google Scholar 

  5. Per Larson, “Dynamic Hashing”, BIT, 1978 Vol. 18(2), pp. 184–201.

    Google Scholar 

  6. Witold Litwin, “Linear Hashing: A New Tool for File and Table Addressing”, Proceedings of the 6th International Conference on VLDB, October 1980.

    Google Scholar 

  7. Witold Litwin, Marie-Anne Niemat, and Donovan Schneider, “LH* — Linear Hashing for Distributed Files”, Proceedings of the 1993 ACM SIGMOD. May 1993.

    Google Scholar 

  8. John Postel, “User Datagram Protocol”, USC/Information Sciences Institute, Internet RFC 768, August 1980.

    Google Scholar 

  9. Margo Seltzer and Ozan Yigit, “A New Hashing Package for UNIX”, USENIX Conference Proceedings — Winter '91, January 1991.

    Google Scholar 

  10. C. Severance, S. Pramanik, and P. Wolberg, “Distributed Linear Hashing and Parallel Projection in Main Memory Databases”, Proceedings of the 16th International Conference on VLDB, Brisbane, Australia, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EECS Department, Computer Science Division, University of California at Berkeley, USA

    Robert Devine

Authors
  1. Robert Devine
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David B. Lomet

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Devine, R. (1993). Design and implementation of DDH: A distributed dynamic hashing algorithm. 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_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-57301-1_7

  • 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

Publish with us

Policies and ethics

Search

Navigation