RP*: A Family of Order-Preserving Scalable Distributed Data Structures
Summary: RP* introduces order-preserving scalable distributed data structures for dynamic files, enabling efficient range queries and ordered traversals. RP*K uses B-tree-like partitioning with multicast; RP*C/S add client/server indexes to reduce multicast while retaining near-LH* point-query performance. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Witold Litwin (Hewlett Packard Enterprise; University of California Berkeley; University of Paris 9)
- 2. Marie-Anne Neimat (Hewlett Packard Enterprise)
- 3. Donovan Schneider (Hewlett Packard Enterprise)
BibTeX Citation
@article{litwin_vldb94,
title = {{RP*: A Family of Order-Preserving Scalable Distributed Data Structures}},
author = {Litwin, Witold and Neimat, Marie-Anne and Schneider, Donovan},
journal = {PVLDB},
series = {{VLDB} '94},
pages = {342--353},
year = {1994}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,438 | Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems | 2004 | VLDB | 0.00010787388 |
| 2,001 | A Practical Scalable Distributed B-Tree | 2008 | VLDB | 9.3326014e-05 |
| 2,278 | BATON: A Balanced Tree Structure for Peer-to-Peer Networks | 2005 | VLDB | 8.8160706e-05 |
| 3,187 | P-Ring: An Efficient and Robust P2P Range Index Structure | 2007 | SIGMOD | 7.6555242e-05 |
| 5,417 | Guaranteeing Correctness and Availability in P2P Range Indices | 2005 | SIGMOD | 6.2255551e-05 |
| 8,953 | Delay Aware Querying with Seaweed | 2006 | VLDB | 5.3458888e-05 |
| 12,967 | Finding Data in the Neighborhood | 1997 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,605 | Lazy Updates for Distributed Search Structure | 1993 | SIGMOD | 8.3494816e-05 |
| 3,465 | LH* — Linear Hashing for Distributed Files | 1993 | SIGMOD | 7.3910846e-05 |
| 4,075 | Distributing a Search Tree Among a Growing Number of Processors | 1994 | SIGMOD | 6.9224298e-05 |
| 4,374 | Distributed File Organization with Scalable Cost/Performance | 1994 | SIGMOD | 6.7370696e-05 |
| 5,445 | Dynamic Data Distribution (D^3) in a Shared-Nothing Multiprocessor Data Store | 1992 | VLDB | 6.2170745e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,801 | Concurrency and Linear Hashing | 1985 | PODS |
| 2 | 4,357 | Balanced Multidimensional Extendible Hash Tree | 1986 | PODS |
| 3 | 7,492 | Scalable Distributed Inverted List Indexes in Disaggregated Memory | 2024 | SIGMOD |
| 4 | 8,371 | A Dynamic Hash File for Random and Sequential Accessing | 1983 | VLDB |
| 5 | 5,577 | A Mapping Function for the Directory of a Multidimensional Extendible Hashing | 1984 | VLDB |
| 6 | 4,932 | Distributed Linear Hashing and Parallel Projection in Main Memory Databases | 1990 | VLDB |
| 7 | 7,318 | LH*RS: A High-Availability Scalable Distributed Data Structure using Reed Solomon Codes | 2000 | SIGMOD |
| 8 | 3,115 | Extendible Hashing for Concurrent Operations and Distributed Data | 1983 | PODS |
| 9 | 4,075 | Distributing a Search Tree Among a Growing Number of Processors | 1994 | SIGMOD |
| 10 | 4,374 | Distributed File Organization with Scalable Cost/Performance | 1994 | SIGMOD |