Supporting Frequent Updates in R-Trees: A Bottom-Up Approach

Summary: Bottom-up R-tree updates for high-frequency, localized streams; avoids expensive top-down reorganization. Introduces a compact in-memory summary enabling direct node access and flexible global-to-local reorganization, delivering higher throughput and better queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9010
Venue: VLDB
Year: 2003
Pagerank: 5.9940496e-05
Overall Rank: 4,683 | 67.46%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,156	SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases	2004	SIGMOD	0.00013606064
1,766	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB	0.00010611043
1,916	A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects	2005	SIGMOD	0.00010110473
2,532	STRIPES: An Efficient Index for Predicted Trajectories	2004	SIGMOD	8.5886308e-05
6,171	A Benchmark for Evaluating Moving Object Indexes	2008	VLDB	5.1705603e-05
6,534	Parallel Main-Memory Indexing for Moving-Object Query and Update Workloads	2012	SIGMOD	5.018905e-05
6,741	AGILE: Adaptive Indexing for Context-Aware Information Filters	2005	SIGMOD	4.9395718e-05
6,766	Workload-Aware Indexing of Continuously Moving Objects	2009	VLDB	4.9280867e-05
9,168	Main-Memory Operation Buffering for Efficient R-Tree Update	2007	VLDB	4.380727e-05
12,420	Towards Efficient Main-Memory Use For Optimum Tree Index Update	2008	VLDB	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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.0032118946
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016113151
24	The R+-Tree: A Dynamic Index For Multi-Dimensional Objects	1987	VLDB	0.00083300888
56	Direct Spatial Search on Pictorial Databases Using Packed R-trees	1985	SIGMOD	0.00065500256
356	Hilbert R-tree: An Improved R-tree Using Fractals	1994	VLDB	0.00026091196
628	Indexing the Positions of Continuously Moving Objects	2000	SIGMOD	0.00018957327
1,004	On Indexing Mobile Objects	1999	PODS	0.00014694512
2,501	The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries	2001	VLDB	8.6367789e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
8,764	Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes	2009	PODS	4.4520434e-05
8,471	Adaptive Index Structures	2002	VLDB	4.4986491e-05
6,766	Workload-Aware Indexing of Continuously Moving Objects	2009	VLDB	4.9280867e-05
9,114	R-Tree Based Indexing of Now-Relative Bitemporal Data	1998	VLDB	4.3887024e-05
3,259	A Revised R*-tree in Comparison with Related Index Structures	2009	SIGMOD	7.3101573e-05
10,565	Efficient Concurrent Updates to Persistent Randomized Binary Search Trees	2025	VLDB	4.1905499e-05
7,046	Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability	2018	VLDB	4.8471584e-05
1,766	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB	0.00010611043
9,168	Main-Memory Operation Buffering for Efficient R-Tree Update	2007	VLDB	4.380727e-05
12,420	Towards Efficient Main-Memory Use For Optimum Tree Index Update	2008	VLDB	4.1905499e-05