Geometric computing and uniform grid technique
Computer-Aided Design
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
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Optimizing multidimensional index trees for main memory access
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Logical and Physical Versioning in Main Memory Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
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
Main-memory operation buffering for efficient R-tree update
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A benchmark for evaluating moving object indexes
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
Managing Frequent Updates in R-Trees for Update-Intensive Applications
IEEE Transactions on Knowledge and Data Engineering
Trees or grids?: indexing moving objects in main memory
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Workload-aware indexing of continuously moving objects
Proceedings of the VLDB Endowment
Automatic contention detection and amelioration for data-intensive operations
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
The COST benchmark—comparison and evaluation of spatio-temporal indexes
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Parallel main-memory indexing for moving-object query and update workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
DaMoN '12 Proceedings of the Eighth International Workshop on Data Management on New Hardware
Daisy: the center for data-intensive systems at Aalborg University
ACM SIGMOD Record
RUM+-tree: a new multidimensional index supporting frequent updates
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
An experimental analysis of iterated spatial joins in main memory
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Modern processors consist of multiple cores that each support parallel processing by multiple physical threads, and they offer ample main-memory storage. This paper studies the use of such processors for the processing of update-intensive moving-object workloads that contain very frequent updates as well as contain queries. The non-trivial challenge addressed is that of avoiding contention between long-running queries and frequent updates. Specifically, the paper proposes a grid-based indexing technique. A static grid indexes a near up-to-date snapshot of the data to support queries, while a live grid supports updates. An efficient cloning technique that exploits the memcpy system call is used to maintain the static grid. An empirical study conducted with three modern processors finds that very frequent cloning, on the order of tens of milliseconds, is feasible, that the proposal scales linearly with the number of hardware threads, and that it significantly outperforms the previous state-of-the-art approach in terms of update throughput and query freshness.