On-line data reduction and the quality of history in moving objects databases
MobiDE '06 Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access
Main-memory operation buffering for efficient R-tree update
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient Maintenance of Continuous Queries for Trajectories
Geoinformatica
Primal or dual: which promises faster spatiotemporal search?
The VLDB Journal — The International Journal on Very Large Data Bases
A benchmark for evaluating moving object indexes
Proceedings of the VLDB Endowment
Towards efficient main-memory use for optimum tree index update
Proceedings of the VLDB Endowment
Indexing of Continuously Moving Objects on Road Networks
IEICE - Transactions on Information and Systems
The RUM-tree: supporting frequent updates in R-trees using memos
The VLDB Journal — The International Journal on Very Large Data Bases
Adaptive indexing of moving objects with highly variable update frequencies
Journal of Computer Science and Technology
Data management challenges for computational transportation
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
Towards Location-Based Real-Time Monitoring Systems in u-LBS
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Update-efficient indexing of moving objects in road networks
Geoinformatica
The VLDB Journal — The International Journal on Very Large Data Bases
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Continuous monitoring of exclusive closest pairs
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Continuous online index tuning in moving object databases
ACM Transactions on Database Systems (TODS)
A moving-object index for efficient query processing with peer-wise location privacy
Proceedings of the VLDB Endowment
Bulkloading updates for moving objects
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Scalable continuous query processing and moving object indexing in spatio-temporal databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Spatial indexing for massively update intensive applications
Information Sciences: an International Journal
An efficient query indexing mechanism for filtering geo-textual data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Frontiers of Computer Science: Selected Publications from Chinese Universities
RUM+-tree: a new multidimensional index supporting frequent updates
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
The problem of frequently updating multi-dimensional indexes arises in many location-dependent applications. While the R-tree and its variants are one of the dominant choices for indexing multi-dimensional objects, the R-tree exhibits inferior performance in the presence of frequent updates. In this paper, we present an R-tree variant, termed the RUM-tree (stands for R-tree with Update Memo) that minimizes the cost of object updates. The RUM-tree processes updates in a memo-based approach that avoids disk accesses for purging old entries during an update process. Therefore, the cost of an update operation in the RUM-tree reduces to the cost of only an insert operation. The removal of old object entries is carried out by a garbage cleaner inside the RUM-tree. In this paper, we present the details of the RUM-tree and study its properties. Theoretical analysis and experimental evaluation demonstrate that the RUMtree outperforms other R-tree variants by up to a factor of eight in scenarios with frequent updates.