Parallel R-trees

Summary: Proposes a multiplexed R-tree across multiple disks on a single server to maximize range-query throughput. Uses a proximity index (PI) heuristic to place new nodes, outperforming Round Robin and Super-node with near-linear speedup and reduced I/O. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 2587
Venue: SIGMOD
Year: 1992
Pagerank: 9.2075292e-05
Overall Rank: 2,246 | 84.38%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Ibrahim Kamel
2. Christos Faloutsos

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
148	Efficient Processing of Spatial Joins Using R-trees	1993	SIGMOD	0.00041182766
5,458	V-Trees - A Storage Method for Long Vector Data	1994	VLDB	5.496829e-05
5,664	Performance of Data-Parallel Spatial Operations	1994	VLDB	5.3821564e-05
6,424	Range Search over Encrypted Multi-Attribute Data	2023	VLDB	5.0670573e-05
7,054	Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability	2018	VLDB	4.8496866e-05
7,729	Processing and Optimization of Multiway Spatial Joins Using R-trees	1999	PODS	4.6660821e-05
9,143	Similarity Query Processing Using Disk Arrays	1998	SIGMOD	4.3850454e-05
10,190	P-MOSS: Scheduling Main-Memory Indexes Over NUMA Servers Using Next Token Prediction	2026	SIGMOD	4.1945683e-05
10,387	Parallel kd-tree with Batch Updates	2025	SIGMOD	4.1945683e-05
12,874	Hamming Filter: A Dynamic Signature File Organization for Parallel Stores	1993	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0032169493
5	The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes	1981	SIGMOD	0.0018397217
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
20	GAMMA - A High Performance Dataflow Database Machine	1986	VLDB	0.00086459551
24	The R+-Tree: A Dynamic Index For Multi-Dimensional Objects	1987	VLDB	0.00083378538
56	Direct Spatial Search on Pictorial Databases Using Packed R-trees	1985	SIGMOD	0.00065631356
76	Spatial Query Processing in an Object-Oriented Database System	1986	SIGMOD	0.00057303551
290	Linear Clustering of Objects with Multiple Attributes	1990	SIGMOD	0.00028919734
725	Optimization Strategies for Spatial Query Processing	1991	VLDB	0.00017529198
1,249	Fractals for Secondary Key Retrieval	1989	PODS	0.00013044758
2,586	Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data	1991	SIGMOD	8.4928908e-05
5,098	Multi-Disk B-trees	1991	SIGMOD	5.7007294e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,258	Main-Memory Operation Buffering for Efficient R-Tree Update	2007	VLDB	4.3690661e-05
3,650	The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree	2004	SIGMOD	6.8783391e-05
4,021	Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures	2016	PODS	6.5225987e-05
3,255	A Revised R*-tree in Comparison with Related Index Structures	2009	SIGMOD	7.3160522e-05
3,039	High-Concurrency Locking in R-Trees	1995	VLDB	7.6708607e-05
6,516	(Almost) Optimal Parallel Block Access for Range Queries	2000	PODS	5.0321577e-05
1,528	A Model for the Prediction of R-tree Performance	1996	PODS	0.00011497734
148	Efficient Processing of Spatial Joins Using R-trees	1993	SIGMOD	0.00041182766
9,143	Similarity Query Processing Using Disk Arrays	1998	SIGMOD	4.3850454e-05
7,054	Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability	2018	VLDB	4.8496866e-05