Distributing a Search Tree Among a Growing Number of Processors
Summary: Proposes a scalable distributed search tree preserving ordered queries (range, nearest neighbor), overcoming limits of prior distributed linear-hashing variants. Empirical results show strong storage utilization and fast query performance at scale, highlighting the need for a formal theory of scalable distributed data structures. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,360 | RP*: A Family of Order-Preserving Scalable Distributed Data Structures | 1994 | VLDB | 8.9670833e-05 |
| 3,400 | Towards Self-Tuning Data Placement in Parallel Database Systems | 2000 | SIGMOD | 7.1346268e-05 |
| 3,964 | Guaranteeing Correctness and Availability in P2P Range Indices | 2005 | SIGMOD | 6.5813475e-05 |
| 12,782 | Finding Data in the Neighborhood | 1997 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 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,243 | Lazy Updates for Distributed Search Structure | 1993 | SIGMOD | 9.212156e-05 |
| 2,879 | LH* - Linear Hashing for Distributed Files | 1993 | SIGMOD | 7.9685334e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,923 | Efficient B-tree Based Indexing for Cloud Data Processing | 2010 | VLDB | 4.6111015e-05 |
| 6,473 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB | 5.0427056e-05 |
| 1,308 | A Heuristic Approach to Distributed Query Processing | 1982 | VLDB | 0.00012664082 |
| 1,956 | On the Design and Scalability of Distributed Shared-Data Databases | 2015 | SIGMOD | 9.9626473e-05 |
| 1,834 | Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks | 2019 | SIGMOD | 0.00010364718 |
| 7,225 | Efficient Search in Very Large Databases | 1988 | VLDB | 4.7910249e-05 |
| 9,499 | Memory-Efficient Search Trees for Database Management Systems | 2021 | SIGMOD | 4.3300131e-05 |
| 2,243 | Lazy Updates for Distributed Search Structure | 1993 | SIGMOD | 9.212156e-05 |
| 1,903 | Extendible Hashing for Concurrent Operations and Distributed Data | 1983 | PODS | 0.00010149071 |
| 4,026 | Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures | 2016 | PODS | 6.5166769e-05 |