Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm

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 ofDDH 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.

• Type: Conference
• Year: 1993
• Where: FODO
• Authors: Robert Devine
• Keywords: Algorithms, Basic Ddh Algorithm, DDH Spreads Data, Dynamic Hashing Algorithms, FODO 1993