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. 1 Introduction Rapidly plunging hardware costs and increasing performance of CPUs and networks mean that future file and database systems are likely to be constructed as networked clusters of nodes. Algorithms should be devised to work in these environments. This paper describes the design and implementation of a distributed hashing algorithm. Quick...

Citations

112	Chained declustering: A new availability strategy for multi-processor database machines - Hsiao, DeWitt - 1990
87	Lh* - linear hashing for distributed files - LITWIN, NEIMAT, et al. - 1993
81	Linear hashing: a new tool for file and table addressing - Litwin - 1998
39	Dynamic hashing - Larson - 1978
18	Accessing replicated data in a large-scale distributed system - Golding, Long - 1991
10	Distributed linear hashing and parallel projection in main memory databases - Severance, Pramanik, et al. - 1990
9	Extensible Hashing - a fast access method for dynamic files - Fagin, Nievergelt, et al. - 1979
6	and Ozan Yigit. A new hashing package for UNIX - Seltzer - 1991
3	and Ozan Yigit, "A New Hashing Package for UNIX - Seltzer - 1991
1	User Datagram Protocol", USC/Information - Postel - 1980