Performance Measurements of RP* : A Scalable Distributed Data Structure For Range Partitioning

The RP* scheme generates the scalable range partitioning. The intervals at the data servers adjust dynamically so that new servers accommodate the file growth transparently for the application. We have implemented variants of RP* on a Windows 2000 multicomputer. We have measured the performance of the system. The experiments prove high efficiency of our implementation. RP* should be of importance to future main-memory parallel DBMSs.

[1]  Witold Litwin,et al.  RP*: A Family of Order Preserving Scalable Distributed Data Structures , 1994, VLDB.

[2]  Witold Litwin,et al.  LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes , 2000, SIGMOD '00.

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

[4]  Witold Litwin,et al.  LH*s: a high-availability and high-security scalable distributed data structure , 1997, Proceedings Seventh International Workshop on Research Issues in Data Engineering. High Performance Database Management for Large-Scale Applications.

[5]  Alok K. Sinha,et al.  Network Programming in Windows NT , 1995 .

[6]  Jim Gray,et al.  The cost of messages , 1988, PODC '88.

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

[8]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[9]  Witold Litwin,et al.  RP: A Family of Order Preserving Scalable , 1994 .