Towards Efficient Main-Memory Use For Optimum Tree Index Update
Summary: Proposes RR-tree to maximize main-memory use for updates in external-storage indexes with high-frequency, low-dimensional sensor data. Supports efficient past-state queries with low overhead; presents RR-tree as a first step and outlines future research. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,987 | Optimizing Multidimensional Index Trees for Main Memory Access | 2001 | SIGMOD | 9.8561164e-05 |
| 1,807 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD | 0.0001047644 |
| 9,499 | Memory-Efficient Search Trees for Database Management Systems | 2021 | SIGMOD | 4.3300131e-05 |
| 9,114 | R-Tree Based Indexing of Now-Relative Bitemporal Data | 1998 | VLDB | 4.3887024e-05 |
| 1,337 | Query Processing in Main Memory Database Management Systems | 1986 | SIGMOD | 0.00012515176 |
| 10,565 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB | 4.1905499e-05 |
| 1,766 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB | 0.00010611043 |
| 235 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB | 0.00031980259 |
| 9,168 | Main-Memory Operation Buffering for Efficient R-Tree Update | 2007 | VLDB | 4.380727e-05 |
| 4,683 | Supporting Frequent Updates in R-Trees: A Bottom-Up Approach | 2003 | VLDB | 5.9940496e-05 |