Issue No. 02 - February (2009 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.159
Wook-Shin Han , Kyungpook National University, Daegu
Jaehwa Kim , Kyungpook National University, Daegu
Byung Suk Lee , University of Vermont, Burlington
Yufei Tao , Chinese University of Hong Kong, Hong Kong
Ralf Rantzau , IBM, San Jose
Volker Markl , IBM, San Jose
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
Spatial databases, temporal databases.
R. Rantzau, W. Han, J. Kim, Y. Tao, B. S. Lee and V. Markl, "Cost-Based Predictive Spatiotemporal Join," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 220-233, 2008.