Main-Memory Operation Buffering for Efficient R-Tree Update
Summary: Main-memory buffering and bulk grouping for R-tree updates, avoiding immediate disk writes and using available RAM to sustain high update rates. Analytical cost model with empirical validation shows improved update I/O over SOTA methods for frequent spatial-index workloads. (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 |
|---|---|---|---|---|
| 6,202 | A Benchmark for Evaluating Moving Object Indexes | 2008 | VLDB | 5.1593242e-05 |
| 6,819 | Workload-Aware Indexing of Continuously Moving Objects | 2009 | VLDB | 4.9158166e-05 |
| 12,138 | MOIST: A Scalable and Parallel Moving Object Indexer with School Tracking | 2012 | VLDB | 4.1945683e-05 |
| 12,411 | Towards Efficient Main-Memory Use For Optimum Tree Index Update | 2008 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 631 | Indexing the Positions of Continuously Moving Objects | 2000 | SIGMOD | 0.00018935493 |
| 2,214 | XXL - A Library Approach to Supporting Efficient Implementations of Advanced Database Queries* | 2001 | VLDB | 9.2726469e-05 |
| 4,692 | Supporting Frequent Updates in R-Trees: A Bottom-Up Approach | 2003 | VLDB | 5.9958252e-05 |
| 5,328 | An Evaluation of Generic Bulk Loading Techniques | 2001 | VLDB | 5.5665496e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,718 | GHOST: Fine Granularity Buffering of Index | 1999 | VLDB | 4.1945683e-05 |
| 7,519 | A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing | 2005 | VLDB | 4.7180617e-05 |
| 8,474 | Adaptive Index Structures | 2002 | VLDB | 4.5029015e-05 |
| 1,309 | Query Processing in Main Memory Database Management Systems | 1986 | SIGMOD | 0.00012660929 |
| 1,774 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB | 0.00010604097 |
| 233 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB | 0.00032021526 |
| 148 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD | 0.00041182766 |
| 1,195 | Buffering Accesses to Memory-Resident Index Structures | 2003 | VLDB | 0.00013406526 |
| 4,692 | Supporting Frequent Updates in R-Trees: A Bottom-Up Approach | 2003 | VLDB | 5.9958252e-05 |
| 12,411 | Towards Efficient Main-Memory Use For Optimum Tree Index Update | 2008 | VLDB | 4.1945683e-05 |