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 SEQUOIA 2000 storage benchmark
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Selectivity estimation in spatial databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A data model and data structures for moving objects databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Selectivity estimation for spatio-temporal queries to moving objects
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
The Effect of Buffering on the Performance of R-Trees
IEEE Transactions on Knowledge and Data Engineering
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Cost and Imprecision in Modeling the Position of Moving Objects
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Fast Incremental Maintenance of Approximate Histograms
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Indexing of Moving Objects for Location-Based Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Indexing moving objects for directions and velocities queries
Information Systems Frontiers
A connectivity index for moving objects in an indoor cellular space
Personal and Ubiquitous Computing
Hi-index | 0.00 |
A query optimizer requires cost models to calculate the costs of various access plans for a query. An effective method to estimate the number of disk (or page) accesses for spatio-temporal queries has not yet been proposed. The TPR-tree is an efficient index that supports spatio-temporal queries for moving objects. Existing cost models for the spatial index such as the R-tree do not accurately estimate the number of disk accesses for spatio-temporal queries using the TPR-tree, because they do not consider the future locations of moving objects, which change continuously as time passes.In this paper, we propose an efficient cost model for spatio-temporal queries to solve this problem. We present analytical formulas which accurately calculate the number of disk accesses for spatio-temporal queries. Extensive experimental results show that our proposed method accurately estimates the number of disk accesses over various queries to spatio-temporal data combining real-life spatial data and synthetic temporal data. To evaluate the effectiveness of our method, we compared our spatio-temporal cost model (STCM) with an existing spatial cost model (SCM). The application of the existing SCM has the average error ratio from 52% to 93%. whereas our STCM has the average error ratio from 11% to 32%.