Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Shoring up persistent applications
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
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
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Closest pair queries in spatial databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Adaptive multi-stage distance join processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient Evaluation of the Valid-Time Natural Join
Proceedings of the Tenth International Conference on Data Engineering
Variable Length Queries for Time Series Data
Proceedings of the 17th International Conference on Data Engineering
Duality-Based Subsequence Matching in Time-Series Databases
Proceedings of the 17th International Conference on Data Engineering
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd 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
Benchmarking Spatial Join Operations with Spatial Output
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Optimisation of Partitioned Termporal Joins
BNCOD 15 Proceedings of the 15th British National Conferenc on Databases: Advances in Databases
Efficient Temporal Join Processing Using Time Index
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Efficient Processing of Time-Joins in Temporal Data Bases
Proceedings of the 3rd International Conference on Database Systems for Advanced Applications (DASFAA)
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
High Performance Data Mining Using the Nearest Neighbor Join
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Efficient Temporal Join Processing Using Indices
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Algorithms for processing K-closest-pair queries in spatial databases
Data & Knowledge Engineering
All-Nearest-Neighbors Queries in Spatial Databases
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
The k-Nearest Neighbour Join: Turbo Charging the KDD Process
Knowledge and Information Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Join operations in temporal databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient indexing of the historical, present, and future positions of moving objects
Proceedings of the 6th international conference on Mobile data management
Efficient trajectory joins using symbolic representations
Proceedings of the 6th international conference on Mobile data management
Complex spatio-temporal pattern queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Spatio-temporal join selectivity
Information Systems
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
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
Gorder: an efficient method for KNN join processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
Indexing large human-motion databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Maintenance of spatial semijoin queries on moving points
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Fast algorithms for the all nearest neighbors problem
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Trajectory Outlier Detection: A Partition-and-Detect Framework
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Synthesizing routes for low sampling trajectories with absorbing Markov chains
WAIM'11 Proceedings of the 12th international conference on Web-age information management
U2STRA: high-performance data management of ubiquitous urban sensing trajectories on GPGPUs
Proceedings of the 2012 ACM workshop on City data management workshop
| Hi-index | 0.00 |
Both spatial and temporal join algorithms have been widely studied in the past, but there is very little work on the more complex problem of trajectory joins, which have many uses in emerging location-based applications. In this paper, we present a general framework, called JiST, that introduces a broad class of trajectory join operations, including trajectory distance join and trajectory k Nearest Neighbors join. Within the JiST framework, we present a set of algorithms to evaluate the trajectory join operations. Finally we present results from detailed experiments that demonstrate the efficiency and scalability of the JiST join algorithms. To the best of our knowledge, JiST is the first comprehensive framework for complex trajectory join operations and lays the foundation for building a complex querying platform for emerging trajectory-based applications.