Efficient trajectory joins using symbolic representations

Authors:
Petko Bakalov;Marios Hadjieleftheriou;Eamonn Keogh;Vassilis J. Tsotras
Affiliations:
University of California, Riverside, Riverside, CA;University of California, Riverside, Riverside, CA;University of California, Riverside, Riverside, CA;University of California, Riverside, Riverside, CA
Venue:
Proceedings of the 6th international conference on Mobile data management
Year:
2005

Citing 27
Cited 9

Efficient processing of spatial joins using R-trees

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Spatial joins using seeded trees

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Spatial hash-joins

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Size separation spatial join

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Incremental distance join algorithms for spatial databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Towards historical R-trees

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
A foundation for representing and querying moving objects

ACM Transactions on Database Systems (TODS)
Locally adaptive dimensionality reduction for indexing large time series databases

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Multiway spatial joins

ACM Transactions on Database Systems (TODS)
Efficient aggregation over objects with extent

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Locally adaptive dimensionality reduction for indexing large time series databases

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
Indexing Animated Objects Using Spatiotemporal Access Methods

IEEE Transactions on Knowledge and Data Engineering
Slot Index Spatial Join

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
Modeling and Querying Moving Objects

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Query Processing Algorithms for Temporal Intersection Joins

Proceedings of the Seventh International Conference on Data Engineering
Scalable Sweeping-Based Spatial Join

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fast Time Sequence Indexing for Arbitrary Lp Norms

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
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
A Performance Evaluation of Spatial Join Processing Strategies

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Discovering Similar Multidimensional Trajectories

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A symbolic representation of time series, with implications for streaming algorithms

DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Indexing multi-dimensional time-series with support for multiple distance measures

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Symbolic representation and retrieval of moving object trajectories

Proceedings of the 6th ACM SIGMM international workshop on Multimedia information retrieval

Time relaxed spatiotemporal trajectory joins

Proceedings of the 13th annual ACM international workshop on Geographic information systems
TS2-tree - an efficient similarity based organization for trajectory data

Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Continuous Spatiotemporal Trajectory Joins

GeoSensor Networks
Design and evaluation of trajectory join algorithms

Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient mutual nearest neighbor query processing for moving object trajectories

Information Sciences: an International Journal
Real-time monitoring of water quality using temporal trajectory of live fish

Expert Systems with Applications: An International Journal
Synthesizing routes for low sampling trajectories with absorbing Markov chains

WAIM'11 Proceedings of the 12th international conference on Web-age information management
Efficient reachability query evaluation in large spatiotemporal contact datasets

Proceedings of the VLDB Endowment
Multiplexing trajectories of moving objects

SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficiently and accurately discovering similarities among moving object trajectories is a difficult problem that appears in many spatiotemporal applications. In this paper we consider how to efficiently evaluate trajectory joins, i.e., how to identify all pairs of similar trajectories between two datasets. Our approach represents an object trajectory as a sequence of symbols (i.e., a string). Based on special lower-bounding distances between two strings, we propose a pruning heuristic for reducing the number of trajectory pairs that need to be examined. Furthermore, we present an indexing scheme designed to support efficient evaluation of string similarities in secondary storage. Through a comprehensive experimental evaluation we present the advantages of the proposed techniques.