OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Robust B+-Tree-Based Indexing of Moving Objects
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Relaxed space bounding for moving objects: a case for the buddy tree
ACM SIGMOD Record
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query and update efficient B+-tree based indexing of moving objects
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The Bdual-Tree: indexing moving objects by space filling curves in the dual space
The VLDB Journal — The International Journal on Very Large Data Bases
A benchmark for evaluating moving object indexes
Proceedings of the VLDB Endowment
Indexing the Trajectories of Moving Objects in Symbolic Indoor Space
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Time-Aware Similarity Search: A Metric-Temporal Representation for Complex Data
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
Workload-aware indexing of continuously moving objects
Proceedings of the VLDB Endowment
Effectively indexing uncertain moving objects for predictive queries
Proceedings of the VLDB Endowment
Continuous online index tuning in moving object databases
ACM Transactions on Database Systems (TODS)
Optimized algorithms for predictive range and KNN queries on moving objects
Information Systems
An adaptive updating protocol for reducing moving object database workload
Proceedings of the VLDB Endowment
TPM: supporting pattern matching queries for road-network trajectory data
Proceedings of the 14th International Conference on Extending Database Technology
Irregularity in high-dimensional space-filling curves
Distributed and Parallel Databases
Optimizing predictive queries on moving objects under road-network constraints
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
MOVIES: indexing moving objects by shooting index images
Geoinformatica
Indexing in-network trajectory flows
The VLDB Journal — The International Journal on Very Large Data Bases
Bs-tree: a self-tuning index of moving objects
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
An adaptive updating protocol for reducing moving object database workload
The VLDB Journal — The International Journal on Very Large Data Bases
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Indexing partial history trajectory and future position of moving objects using HTPR*-Tree
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Boosting moving object indexing through velocity partitioning
Proceedings of the VLDB Endowment
MOIST: a scalable and parallel moving object indexer with school tracking
Proceedings of the VLDB Endowment
Predictive line queries for traffic prediction
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
Predictive spatio-temporal queries: a comprehensive survey and future directions
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
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
Hi-index | 0.00 |
In a moving objects database (MOD) the dataset and the workload change frequently. As the locations of objects change in space and time, the data distribution also changes and the answer for a same query over the same region may vary widely over time. As a result, traditional static indexes are not able to perform well and it is critical to develop self-tuning indexes that can be reconfigured automatically based on the state of the system. Towards this goal we propose the ST2B-tree, a Self-Tunable Spatio-Temporal B+-Tree index for MODs, which is amenable to tuning. Frequent updates to its subtrees allows rebuilding (tuning) a subtree using a different set of reference points and different grid size without significant overhead. We also present an online tuning framework for the ST2B-tree, where the tuning is conducted online and automatically without human intervention, also not interfering with regular functions of the MOD. Our extensive experiments show that the self-tuning process minimizes the effectiveness degradation of the index caused by workload changes at the cost of virtually no overhead.