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
- 1. Laurynas Biveinis (Aalborg University)
- 2. Simonas Šaltenis (Aalborg University)
- 3. Christian S. Jensen (Aalborg University)
BibTeX Citation
@article{biveinis_vldb07,
title = {{Main-Memory Operation Buffering for Efficient R-Tree Update}},
author = {Biveinis, Laurynas and Šaltenis, Simonas and Jensen, Christian S.},
journal = {PVLDB},
series = {{VLDB} '07},
volume = {1},
number = {1},
pages = {591--602},
year = {2007}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 |
| 12,334 | MOIST: A Scalable and Parallel Moving Object Indexer with School Tracking | 2012 | VLDB | 5.093636e-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 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.0020210012 |
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.001157935 |
| 560 | Indexing the Positions of Continuously Moving Objects | 2000 | SIGMOD | 0.00016525569 |
| 2,960 | XXL - A Library Approach to Supporting Efficient Implementations of Advanced Database Queries | 2001 | VLDB | 7.9182423e-05 |
| 4,569 | Supporting Frequent Updates in R-Trees: A Bottom-Up Approach | 2003 | VLDB | 6.6255507e-05 |
| 5,304 | An Evaluation of Generic Bulk Loading Techniques | 2001 | VLDB | 6.2733516e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,911 | GHOST: Fine Granularity Buffering of Index Pages | 1999 | VLDB |
| 2 | 7,939 | A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing | 2005 | VLDB |
| 3 | 8,689 | Adaptive Index Structures | 2002 | VLDB |
| 4 | 1,355 | Query Processing in Main Memory Database Management Systems | 1986 | SIGMOD |
| 5 | 2,020 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB |
| 6 | 219 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB |
| 7 | 145 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD |
| 8 | 1,110 | Buffering Accesses to Memory-Resident Index Structures | 2003 | VLDB |
| 9 | 4,569 | Supporting Frequent Updates in R-Trees: A Bottom-Up Approach | 2003 | VLDB |
| 10 | 12,605 | Towards Efficient Main-Memory Use For Optimum Tree Index Update | 2008 | VLDB |