Main-Memory Operation Buffering for Efficient R-Tree Update

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

37 Citations (Scopus)

Abstract

Emerging communication and sensor technologies enable new applications of database technology that require database systems to efficiently support very high rates of spatial-index updates. Previous works in this area require the availability of large amounts of main memory, do not exploit all the main memory that is indeed available, or do not support some of the standard index operations.
Assuming a setting where the index updates need not be written to disk immediately, we propose an R-tree-based indexing technique that does not exhibit any of these drawbacks. This technique exploits the buffering of update operations in main memory as well as the grouping of operations to reduce disk I/O. In particular, operations are performed in bulk so that multiple operations are able to share I/O. The paper presents an analytical cost model that is shown to be accurate by empirical studies. The studies also show that, in terms of update I/O performance, the proposed technique improves on state of the art in settings with frequent updates.
Original languageEnglish
Title of host publicationProceedings of the Thirtythird International Conference on Very Large Data Bases
Publication date2007
Pages591-602
Publication statusPublished - 2007
EventThe Thirtythird International Conference on Very Large Data Bases - Vienna, Austria
Duration: 23 Sep 200728 Sep 2007
Conference number: 33

Conference

ConferenceThe Thirtythird International Conference on Very Large Data Bases
Number33
CountryAustria
CityVienna
Period23/09/200728/09/2007

Fingerprint Dive into the research topics of 'Main-Memory Operation Buffering for Efficient R-Tree Update'. Together they form a unique fingerprint.

Cite this