DBScholar

Back to papers

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

Summary: Introduces a bottom-up R-tree update strategy for high-rate, locality-aware streams, using a compact in-memory node-access summary and global-to-local reorganization. It avoids costly top-down updates while improving update throughput, scalability, and query quality. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
9200
Venue
VLDB
Year
2003
Pagerank
6.6255507e-05
Overall Rank
4,569 | 68.66%
DOI
10.1016/B978-012722442-8/50060-4

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{lee_vldb03,
        title = {{Supporting Frequent Updates in R-Trees: A Bottom-Up Approach}},
        author = {Lee, Mong Li and Hsu, Wynne and Jensen, Christian S. and Cui, Bin and Teo, Keng Lik},
        journal = {PVLDB},
        series = {{VLDB} '03},
        doi = {10.1016/B978-012722442-8/50060-4},
        url = {https://doi.org/10.1016/B978-012722442-8/50060-4},
        year = {2003}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank Citing Paper Year Venue Pagerank
1,201 SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases 2004 SIGMOD 0.00011674339
1,698 A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects 2005 SIGMOD 9.980335e-05
2,020 Query and Update Efficient B+-Tree Based Indexing of Moving Objects 2004 VLDB 9.2983514e-05
2,254 STRIPES: An Efficient Index for Predicted Trajectories 2004 SIGMOD 8.8603695e-05
5,740 A Benchmark for Evaluating Moving Object Indexes 2008 VLDB 6.1035012e-05
6,458 Workload-Aware Indexing of Continuously Moving Objects 2009 VLDB 5.8736158e-05
6,488 Parallel Main-Memory Indexing for Moving-Object Query and Update Workloads 2012 SIGMOD 5.865078e-05
6,647 AGILE: Adaptive Indexing for Context-Aware Information Filters 2005 SIGMOD 5.8147547e-05
9,324 Main-Memory Operation Buffering for Efficient R-Tree Update 2007 VLDB 5.289545e-05
12,605 Towards Efficient Main-Memory Use For Optimum Tree Index Update 2008 VLDB 5.093636e-05
Previous Page 1 / 1 Next

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.0020210012
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
42 The R+-Tree: A Dynamic Multi-Dimensional Index for Objects 1987 VLDB 0.00046170812
116 Direct Spatial Search on Pictorial Databases Using Packed R-trees 1985 SIGMOD 0.0003221055
329 Hilbert R-tree: An Improved R-tree Using Fractals 1994 VLDB 0.00021068647
560 Indexing the Positions of Continuously Moving Objects 2000 SIGMOD 0.00016525569
896 On Indexing Mobile Objects 1999 PODS 0.0001334014
2,282 The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries 2001 VLDB 8.8103794e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 8,937 Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes 2009 PODS
2 8,689 Adaptive Index Structures 2002 VLDB
3 6,458 Workload-Aware Indexing of Continuously Moving Objects 2009 VLDB
4 9,343 R-Tree Based Indexing of Now-Relative Bitemporal Data 1998 VLDB
5 2,974 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD
6 10,824 Efficient Concurrent Updates to Persistent Randomized Binary Search Trees 2025 VLDB
7 7,151 Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability 2018 VLDB
8 2,020 Query and Update Efficient B+-Tree Based Indexing of Moving Objects 2004 VLDB
9 9,324 Main-Memory Operation Buffering for Efficient R-Tree Update 2007 VLDB
10 12,605 Towards Efficient Main-Memory Use For Optimum Tree Index Update 2008 VLDB