Abstract

Hash-based scalable distributed data structures (SDDSs), like LH * and DDH, for networks of intcmonnected ampllters (multicomputers) were shown to open new perspectives for fik management. We prcpose a family of ordered SDDSs, called P, providing for ordered and dynamic files on mutticomputers, and thus for more etlicknt pmeessing of range queries and of ordered traversak of files The basic algorithm termed RP*K builds the file with the same key space partitioning as a Etree, but avoids indexes through the use of multi&. The a&nithms, RP*c and RP*s enbance throughput for faster network adding the indexes on clients, or OII clients and sexve-rs, while eithe-r decmsing or avoiding multicast. Rpo files are shown highly efficient with access performance exceeding traditional files by an order of magnitude or two, an & for non-range queries very close to LH*. 1.

Citations

1084	The Design and Analysis of Spatial Data Structures - Samet - 1990
471	LogP: towards a realistic model of parallel computation - Culler, Karp, et al. - 1993
353	The Midway Distributed Shared Memory System. Compcon Spring ’93, Digest of Papers - Bershad, Zekauskas, et al. - 1993
98	LH* - A scalable, distributed data structure - Litwin, Neimat, et al. - 1996
87	Lh* - linear hashing for distributed files - LITWIN, NEIMAT, et al. - 1993
63	Distributing a search tree among a growing number of processors - Kröll, Widmayer - 1994
54	Design and Implementation of DDH: Distributed Dynamic Hashing - Devine - 1993
33	Lazy Updates for Distributed Search Structures - Johnson, Krishna - 1993
27	The Cost of Messages - Gray - 1989
25	Distributed File Organization with Scalable Cost/Performance - Vingralek, Breitbart, et al. - 1994
13	An efficient method for distributing search structures - Matsliach, Shmueli - 1991
9	Dynamic Data Distribution (D3 ) in a Shared-Nothing Multiprocessor Data Store - Chamberlin, Schmuck - 1992
8	Trie hashing with controlled load - Litwin, Roussopoulos, et al. - 1991
5	NOW: Towards Everyday Supercomputing on a Network of Workstations - Culler - 1994
3	Algorithms for Distributed Query Processing in Broadcast Local Area Networks - Perrizo, Lin, et al. - 1989
3	Dynamic Data Distribution (D 3 ) in a Shared-Nothing Multiprocessor Data Store - Chamberlin, Schmuck - 1992
2	RP* : a Scalable Distributed Data Structure using Multicast (extended abstract - Litwin, Neimat, et al. - 1993
2	Distributing a B+-tree in a loosely coupled environment - Matsliach, Shmueli - 1990
1	The Midway Distributed Shard Memory System IEEECOMPSAC 1993,528~537. vJ31 Pw [ChS92 - Bashad, Zekauskas, et al. - 1993
1	Dynamic Data Distribution(d) in a Shared-Nothing Multipmcessa Data Store. VLDB-92,1992 - Chambedin, Schmuck
1	Cbnf On Mamgement of L&a - Litwin, S&eider, et al. - 1993
1	A sallabk Distributed Data stNchlm - Litwin, Neimat, et al. - 1993
1	Sdmeidq D. RP’ : A Family of O&s Rawrving Sulabk Di&ributed Data Struchuw HPL-DTD-94012 - Litwin, Ncimat - 1994
1	The Perinatal Safety Review Working Group. Nucleoside exposure in the children of HIVinfected women receiving antiretroviral drugs: absence of clear evidence for mitochondrial disease in children who died before 5 years of age in five United States cohort - unknown authors - 2000
1	An Efficient Method far Di&ibuting Search Stnu%ues - Matsliach, Shmueli - 1991
1	Algorithms fa Distri~QueryF%cessinginBm&astLocalArra Netwoks - Pen&, Lin, et al.
1	The Design and Amlysis of Spalial Data struczure3 - Sam - 1989
1	A Generalization of Binary Search. Algorithms and Data Structures - Karp - 1993