Towards Efficient Main-Memory Use For Optimum Tree Index Update

Summary: Introduces the RR-tree for high-throughput updates on low-dimensional, sensor-driven data by exploiting main memory under relaxed persistence. Supports efficient past-state queries while limiting update-performance impact, highlighting a largely neglected design space. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 10001
Venue: VLDB
Year: 2008
Pagerank: 5.093636e-05
Overall Rank: 12,605 | 13.52%
DOI: 10.14778/1454159.1454215

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Laurynas Biveinis (Aalborg University)

BibTeX Citation

@article{biveinis_vldb08,
        title = {{Towards Efficient Main-Memory Use For Optimum Tree Index Update}},
        author = {Biveinis, Laurynas},
        journal = {PVLDB},
        series = {{VLDB} '08},
        volume = {1},
        number = {1},
        pages = {1617--1618},
        doi = {10.14778/1454159.1454215},
        url = {https://doi.org/10.14778/1454159.1454215},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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.

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
59	Differential Files: Their Application To The Maintenance Of Large Data Bases	1976	SIGMOD	0.00040060625
109	DBMSs On A Modern Processor: Where Does Time Go?	1999	VLDB	0.000331207
202	Generalized Search Trees for Database Systems (Extended Abstract)	1995	VLDB	0.00025454884
219	A Study of Index Structures for Main Memory Database Management Systems	1986	VLDB	0.00024293529
560	Indexing the Positions of Continuously Moving Objects	2000	SIGMOD	0.00016525569
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
6,647	AGILE: Adaptive Indexing for Context-Aware Information Filters	2005	SIGMOD	5.8147547e-05
7,663	Index Access with a Finite Buffer	1987	VLDB	5.5725248e-05
9,324	Main-Memory Operation Buffering for Efficient R-Tree Update	2007	VLDB	5.289545e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,978	Optimizing Multidimensional Index Trees for Main Memory Access	2001	SIGMOD
2	1,813	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD
3	9,635	Memory-Efficient Search Trees for Database Management Systems	2021	SIGMOD
4	9,343	R-Tree Based Indexing of Now-Relative Bitemporal Data	1998	VLDB
5	1,355	Query Processing in Main Memory Database Management Systems	1986	SIGMOD
6	10,824	Efficient Concurrent Updates to Persistent Randomized Binary Search Trees	2025	VLDB
7	2,020	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB
8	219	A Study of Index Structures for Main Memory Database Management Systems	1986	VLDB
9	9,324	Main-Memory Operation Buffering for Efficient R-Tree Update	2007	VLDB
10	4,569	Supporting Frequent Updates in R-Trees: A Bottom-Up Approach	2003	VLDB