Continuous Spatiotemporal Trajectory Joins

Authors:
Petko Bakalov;Vassilis J. Tsotras
Affiliations:
Computer Science Department, University of California, Riverside,;Computer Science Department, University of California, Riverside,
Venue:
GeoSensor Networks
Year:
2008

Citing 32
Cited 0

Fractals for secondary key retrieval

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
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
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 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
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects

IEEE Transactions on Computers
Slot Index Spatial Join

IEEE Transactions on Knowledge and 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
A Performance Evaluation of Spatial Join Processing Strategies

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree

MDM '02 Proceedings of the Third International Conference on Mobile Data Management
Indexing of Moving Objects for Location-Based Services

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
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
Monitoring k-Nearest Neighbor Queries over Moving Objects

ICDE '05 Proceedings of the 21st International Conference on 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
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
GPAC: generic and progressive processing of mobile queries over mobile data

Proceedings of the 6th international conference on Mobile data management
Time relaxed spatiotemporal trajectory joins

Proceedings of the 13th annual ACM international workshop on Geographic information systems
Supporting frequent updates in R-trees: a bottom-up approach

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Approximate NN queries on streams with guaranteed error/performance bounds

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given the plethora of GPS and location-based services, que- ries over trajectories have recently received much attention. In this paper we examine trajectory joins over streaming spatiotemporal data. Given a stream of spatiotemporal trajectories created by monitored moving objects, the outcome of a Continuous Spatiotemporal Trajectory Join(CSTJ) query is the set of objects in the stream, which have shown similar behavior over a query-specified time interval, relative to the current timestamp. We propose a novel indexing scheme for streaming spatiotemporal data and develop algorithms for CSTJ evaluation, which utilize the proposed indexing scheme and effectively reduce the computation cost and I/O operations. Finally, we present a thorough experimental evaluation of the proposed indexing structure and algorithms.