Please use this identifier to cite or link to this item:

Time-parameterized queries in spatio-temporal databases

Authors Tao, Y.
Papadias, D. View this author's profile
Issue Date 2002
Source Proceedings of the ACM SIGMOD International Conference on Management of Data , 2002, p. 334-345
Summary Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current motion of the query and the database objects, and (iii) the change that causes the expiration of the result. Due to the highly dynamic nature of several spatio-temporal applications, TP queries are important both as standalone methods, as well as building blocks of more complex operations. However, little work has been done towards their efficient processing. In this paper, we propose a general framework that covers time-parameterized variations of the most common spatial queries, namely window queries, k-nearest neighbors and spatial joins. In particular, each of these TP queries is reduced to nearest neighbor search where the distance functions are defined according to the query type. This reduction allows the application and extension of well-known branch and bound techniques to the current problem. The proposed methods can be applied with mobile queries, mobile objects or both, given a suitable indexing method. Our experimental evaluation is based on R-trees and their extensions for dynamic objects.
ISSN 0730-8078
Rights © ACM, 2002. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings / ACM-SIGMOD International Conference on Management of Data, Madison, WI, USA, 3-6 June 2002, ACM, New York, USA, 2002, p. 334-345
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Scopus
Files in this item:
File Description Size Format
Sigmod02TP.pdf 204836 B Adobe PDF