W. Litwin, M-A Neimat, D. Schneider  Home/Search
Context
Related
| berkeley.edu/techreports...S2K9446.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/accessPa...S2K9446 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Hash-based scalable distributed data structures (SDDSs), like LH* or 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 range partitioning as a B-tree,... (Update)
Active bibliography (related documents): More All
0.5: Query Plans - Their Cost and Generation in a Distributed.. - Semeczko, Su (Correct)
0.5: On Computing the Subset Graph of a Collection of Sets - Pritchard (1995) (Correct)
0.4: LH*g: a High-availability Scalable Distributed Data Structure.. - Litwin, Risch (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@inproceedings{ litwin94rp,
author = "W. Litwin and M-A Neimat and D. Schneider",
title = "{RP*: A Family of Order Preserving Scalable Distributed Data Structures}",
booktitle = "Proceedings of the Twentieth International Conference on Very Large Databases",
address = "Santiago, Chile",
pages = "342--353",
year = "1994",
url = "citeseer.ist.psu.edu/736278.html" }
Citations (may not include all citations):666 The Design and Analysis of Spatial Data Structures (context) - Samet - 1989
531 LogP: Towards a Realistic Model of Parallel Computation - Culler - 1993
301 The Midway Distributed Shared Memory System (context) - Bershad, Zekauskas et al. - 1993
37 A Family of Order Preserving Scalable Distributed Data Struc.. (context) - Litwin, Neimat - 1994
34 Memory Servers for Multicomputers - Iftode, Li et al. - 1993
31 Design and Implementation of DDH: Distributed Dynamic Hashin.. - Devine - 1993
31 Linear Hashing for Distributed Files (context) - Litwin, Neimat - 1993
19 Lazy Updates for Distributed Search Structure - Johnson, Krishna - 1993
18 A Scalable Distributed Data Structure (context) - Litwin, Neimat - 1993
10 An Efficient Method for Distributing Search Structures (context) - Matsliach, Shmueli - 1991
7 Dynamic Data Distribution (context) - Chamberlin, Schmuck - 1992
7 Distributed File Organization with Scalable CostPerformance - Breitbart, Yavatkar et al. - 1994
7 NOW: Towards Everyday Supercomputing on a Network of Worksta.. (context) - Culler
5 Trie Hashing With Controlled Load (context) - Litwin, Roussopoulos et al. - 1991
2 A Generalization of Binary Search (context) - Karp - 1993
2 Algorithms for Distributed Query Processing in Broadcast Loc.. (context) - Perrizo, Lin et al. - 1989
1 a Scalable Distributed Data Structure using Multicast (context) - Litwin, Neimat - 1993
1 Node Autononmy in Distributed Systems (context) - Garcia-Molina, Kogan - 1988
1 on Principles of Distributed Systems (context) - Gray - 1988
1 tree in a loosely coupled environment (context) - Matsliach, Shmueli et al. - 1990
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC