Database Paper Browser

Back to papers

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)

Paper ID
2732
Venue
SIGMOD
Year
1994
Pagerank
6.7525564e-05
Overall Rank
3,804 | 73.54%
DOI
-

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,353 RP*: A Family of Order-Preserving Scalable Distributed Data Structures 1994 VLDB 8.9752351e-05
3,401 Towards Self-Tuning Data Placement in Parallel Database Systems 2000 SIGMOD 7.1400085e-05
3,962 Guaranteeing Correctness and Availability in P2P Range Indices 2005 SIGMOD 6.5876809e-05
12,773 Finding Data in the Neighborhood 1997 VLDB 4.1945683e-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,238 Lazy Updates for Distributed Search Structure 1993 SIGMOD 9.2209967e-05
2,872 LH* - Linear Hashing for Distributed Files 1993 SIGMOD 7.9762569e-05
Previous Page 1 / 1 Next

Semantically Similar Papers