论文信息 - Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm

Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm

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.

Robert Devine | Robert Devine

[1] Margo I. Seltzer,et al. A New Hashing Package for UNIX , 1991, USENIX Winter.

[2] Sakti Pramanik,et al. Distributed Linear Hashing and Parallel Projection in Main Memory Databases , 1990, VLDB.

[3] Darrell D. E. Long,et al. Accessing Replicated Data in a Large-Scale Distributed System , 1991, Int. J. Comput. Simul..

[4] Witold Litwin,et al. LH* - Linear Hashing for Distributed Files , 1993, SIGMOD Conference.

[5] Witold Litwin,et al. Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.

[6] David J. DeWitt,et al. Chained declustering: a new availability strategy for multiprocessor database machines , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[7] Ronald Fagin,et al. Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[8] Jon Postel,et al. User Datagram Protocol , 1980, RFC.

[9] Steven V. Earhart. UNIX programmer's manual , 1986 .