Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The Computer Journal - Special issue on parallel computing
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Trajectory queries and octagons in moving object databases
Proceedings of the eleventh international conference on Information and knowledge management
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
IEEE Transactions on Knowledge and Data Engineering
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
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
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
SEB-tree: An Approach to Index Continuously Moving Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Generating Network-Based Moving Objects
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Spatio-Temporal Indexing for Large Multimedia Applications
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Indexing spatio-temporal trajectories with Chebyshev polynomials
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Prediction and indexing of moving objects with unknown motion patterns
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
Roads, codes, and spatiotemporal queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A trajectory splitting model for efficient spatio-temporal indexing
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
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 processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
PA-tree: a parametric indexing scheme for spatio-temporal trajectories
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Scalable processing of trajectory-based queries in space-partitioned moving objects databases
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Efficient search of moving objects on a planar graph
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
On the effect of trajectory compression in spatiotemporal querying
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
A visual analytics system for metropolitan transportation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Ordered polyline trees for efficient search of objects moving on a graph
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part I
Machine learning for vessel trajectories using compression, alignments and domain knowledge
Expert Systems with Applications: An International Journal
Calibrating trajectory data for similarity-based analysis
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Mobile Networks and Applications
| Hi-index | 0.00 |
Complex queries on trajectory data are increasingly common in applications involving moving objects. MBR or grid-cell approximations on trajectories perform suboptimally since they do not capture the smoothness and lack of internal area of trajectories. We describe a parametric space indexing method for historical trajectory data, approximating a sequence of movement functions with single continuous polynomial. Our approach works well, yielding much finer approximation quality than MBRs. We present the PA-tree, a parametric index that uses this method, and show through extensive experiments that PA-trees have excellent performance for offline and online spatio-temporal range queries. Compared to MVR-trees, PA-trees are an order of magnitude faster to construct and incur I/O cost for spatio-temporal range queries lower by a factor of 2-4. SETI is faster than our method for index construction and timestamp queries, but incurs twice the I/O cost for time interval queries, which are much more expensive and are the bottleneck in online processing. Therefore, the PA-tree is an excellent choice for both offline and online processing of historical trajectories.