RP*: A Family of Order Preserving Scalable Distributed Data Structures.

Witold Litwin, Marie-Anne Neimat, Donovan A. Schneider: RP*: A Family of Order Preserving Scalable Distributed Data Structures. VLDB 1994: 342-353

@inproceedings{DBLP:conf/vldb/LitwinNS94,
  author    = {Witold Litwin and
               Marie-Anne Neimat and
               Donovan A. Schneider},
  editor    = {Jorge B. Bocca and
               Matthias Jarke and
               Carlo Zaniolo},
  title     = {RP*: A Family of Order Preserving Scalable Distributed Data Structures},
  booktitle = {VLDB'94, Proceedings of 20th International Conference on Very
               Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile},
  publisher = {Morgan Kaufmann},
  year      = {1994},
  isbn      = {1-55860-153-8},
  pages     = {342-353},
  ee        = {db/conf/vldb/vldb94-342.html},
  crossref  = {DBLP:conf/vldb/94},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Hash-based scalable distributed data structures (SDDSs), like LH* and DDH, for networks of interconnected computers (multicomputers) were shown to open new perspectives for file management. We propose a family of ordered SDDSs, called RP*, providing for ordered and dynamic files on multicomputers, and thus for more efficient processing of range queries and of ordered traversals of files. The basic algorithm, termed RP*N, builds the file with the same key space partitioning as a B-tree, but avoids indexes through the use of multicast. The algorithms, RP*C and RP*S enhance throughput for faster networks, adding indexes on clients, or on clients and servers, while either decreasing or avoiding multicast. RP* files are shown highly efficient with access performance exceeding traditional files by an order of magnitude or two, and, for non-range queries, very close to LH*.

Copyright © 1994 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb8997 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Jorge B. Bocca, Matthias Jarke, Carlo Zaniolo (Eds.): VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile. Morgan Kaufmann 1994, ISBN 1-55860-153-8
Contents

References

[BZS93]: ...
[C93]: David E. Culler, Richard M. Karp, David A. Patterson, Abhijit Sahay, Klaus E. Schauser, Eunice E. Santos, Ramesh Subramonian, Thorsten von Eicken: LogP: Towards a Realistic Model of Parallel Computation. PPOPP 1993: 1-12
[C94]: ...
[ChS92]: Donald D. Chamberlin, Frank B. Schmuck: Dynamic Data Distribution (D³) in a Shared-Nothing Multiprocessor Data Store. VLDB 1992: 163-174
[D93]: Robert Devine: Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm. FODO 1993: 101-114
[G88]: Jim Gray: The Cost of Messages. PODC 1988: 1-7
[G88a]: Hector Garcia-Molina, Boris Kogan: Node Autonomy in Distributed Systems. DPDS 1988: 158-166
[K93]: Richard M. Karp: A Generalization of Binary Search. WADS 1993: 27-34
[KW94]: Brigitte Kröll, Peter Widmayer: Distributing a Search Tree Among a Growing Number of Processors. SIGMOD Conference 1994: 265-276
[ILP93]: ...
[JK93]: Theodore Johnson, Padmashree Krishna: Lazy Updates for Distributed Search Structure. SIGMOD Conference 1993: 337-346
[LNS93]: Witold Litwin, Marie-Anne Neimat, Donovan A. Schneider: LH* - Linear Hashing for Distributed Files. SIGMOD Conference 1993: 327-336
[LNS93a]: Witold Litwin, Marie-Anne Neimat, Donovan A. Schneider: LH* - A Scalable, Distributed Data Structure. ACM Trans. Database Syst. 21(4): 480-525(1996)
[LNS93b]: ...
[LNS94]: ...
[LRLH91]: Witold Litwin, Nick Roussopoulos, Gérald Lévy, Wang Hong: Trie Hashing With Controlled Load. IEEE Trans. Software Eng. 17(7): 678-691(1991)
[MS90]: Gabriel Matsliach, Oded Shmueli: Distributing A B+-Tree in a Loosely Coupled Environment. Inf. Process. Lett. 34(6): 313-321(1990)
[MS91]: Gabriel Matsliach, Oded Shmueli: An Efficient Method for Distributing Search Structures. PDIS 1991: 159-166
[PLH89]: William Perrizo, Jonathan Y. Y. Lin, Wherly Hoffman: Algorithms for Distributed Query Processing in Broadcast Local Area Networks. IEEE Trans. Knowl. Data Eng. 1(2): 215-225(1989)
[S89]: Hanan Samet: The Design and Analysis of Spatial Data Structures. Addison-Wesley 1990
[VBWY94]: Radek Vingralek, Yuri Breitbart, Gerhard Weikum: Distributed File Organization with Scalable Cost/Performance. SIGMOD Conference 1994: 253-264