The Community for Technology Leaders
Green Image
Issue No. 02 - February (2009 vol. 21)
ISSN: 1041-4347
pp: 220-233
Ralf Rantzau , IBM, San Jose
Wook-Shin Han , Kyungpook National University, Daegu
Jaehwa Kim , Kyungpook National University, Daegu
Yufei Tao , Chinese University of Hong Kong, Hong Kong
Byung Suk Lee , University of Vermont, Burlington
Volker Markl , IBM, San Jose
ABSTRACT
A predictive spatiotemporal join finds all pairs of moving objects satisfying a join condition on future time and space. In this paper, we present CoPST, the first and foremost algorithm for such a join using two spatiotemporal indexes. In a predictive spatiotemporal join, the bounding boxes of the outer index are used to perform window searches on the inner index, and these bounding boxes enclose objects with increasing laxity over time. CoPST constructs globally tightened bounding boxes "on the fly
INDEX TERMS
Spatial databases, temporal databases.
CITATION
Ralf Rantzau, Wook-Shin Han, Jaehwa Kim, Yufei Tao, Byung Suk Lee, Volker Markl, "Cost-Based Predictive Spatiotemporal Join", IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 220-233, February 2009, doi:10.1109/TKDE.2008.159
96 ms
(Ver 3.3 (11022016))