The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Updating and Querying Databases that Track Mobile Units
Distributed and Parallel Databases - Special issue on mobile data management and applications
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Concurrency Control in B-Trees with Batch Updates
IEEE Transactions on Knowledge and Data Engineering
Performance of On-Line Index Construction Algorithms
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th International Conference on Very Large Data Bases
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Revisiting R-Tree Construction Principles
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
GBI: A Generalized R-Tree Bulk-Insertion Strategy
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Grow and Post Index Trees: Roles, Techniques and Future Potential
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Techniques for Efficient Road-Network-Based Tracking of Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Handling frequent updates of moving objects
Proceedings of the 14th ACM international conference on Information and knowledge management
B-tree indexes for high update rates
ACM SIGMOD Record
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Robust B+-Tree-Based Indexing of Moving Objects
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
LUGrid: Update-tolerant Grid-based Indexing for Moving Objects
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Supporting frequent updates in R-trees: a bottom-up approach
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The COST benchmark—comparison and evaluation of spatio-temporal indexes
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
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 Moving Objects Using Short-Lived Throwaway Indexes
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
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
An extended MD-tree with internal leaf for efficient management of moving objects
Journal of Computational Methods in Sciences and Engineering
Scalable continuous range monitoring of moving objects in symbolic indoor space
Proceedings of the 18th ACM conference on Information and knowledge management
Trees or grids?: indexing moving objects in main memory
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Workload-aware indexing of continuously moving objects
Proceedings of the VLDB Endowment
Thread-level parallel indexing of update intensive moving-object workloads
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
MOVIES: indexing moving objects by shooting index images
Geoinformatica
An update-aware storage system for low-locality update-intensive workloads
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Spatial indexing for massively update intensive applications
Information Sciences: an International Journal
MOIST: a scalable and parallel moving object indexer with school tracking
Proceedings of the VLDB Endowment
Daisy: the center for data-intensive systems at Aalborg University
ACM SIGMOD Record
| Hi-index | 0.00 |
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.