Time-parameterized queries in spatio-temporal databases
Authors:
Open Access
- 3 June 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 334-345
Abstract
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 objectsKeywords
This publication has 13 references indexed in Scilit:
- Indexing the positions of continuously moving objects2000
- Distance browsing in spatial databasesACM Transactions on Database Systems, 1999
- On indexing mobile objects1999
- Optimal multi-step k-nearest neighbor search1998
- A cost model for similarity queries in metric spaces1998
- A Quadtree-Based Dynamic Attribute Indexing MethodThe Computer Journal, 1998
- Nearest neighbor queries1995
- Efficient processing of spatial joins using R-trees1993
- Continuous queries over append-only databases1992
- The R*-tree: an efficient and robust access method for points and rectangles1990