Design and implementation of DDH: A distributed dynamic hashing algorithm

  • Robert Devine
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 730)


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.


Hash Table Distribute Hash Table User Datagram Protocol Split Level Collision Resolution 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    AT&T, DBM(3X), Unix Programmer's Manual, System V.3, pp. 506–8, 1985.Google Scholar
  2. 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. 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. 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. 5.
    Per Larson, “Dynamic Hashing”, BIT, 1978 Vol. 18(2), pp. 184–201.Google Scholar
  6. 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. 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. 8.
    John Postel, “User Datagram Protocol”, USC/Information Sciences Institute, Internet RFC 768, August 1980.Google Scholar
  9. 9.
    Margo Seltzer and Ozan Yigit, “A New Hashing Package for UNIX”, USENIX Conference Proceedings — Winter '91, January 1991.Google Scholar
  10. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Robert Devine
    • 1
  1. 1.EECS Department, Computer Science DivisionUniversity of California at BerkeleyUSA

Personalised recommendations