ACM Transactions on Database Systems · 2003 · 91 citations · 32 references
ComputingComputer ScienceDatabasesGeographic Information SystemsSpatial AnalysisNearest Neighbor SearchQuery OptimizationQuery ProcessingSpatial Database SystemsSpatial DatabasesTemporal DatabasesCost Minimization ModelsCost ModelsProcessing Cost ModelsRange QueriesSpatial JoinsSpatial Query ProcessingSpatial QueryingSpatiotemporal Query Processing
Conventional spatial queries are usually meaningless in dynamic environments since their results may be invalidated as soon as the query or data objects move. In this paper we formulate two novel query types, time parameterized and continuous queries , applicable in such environments. A time-parameterized query retrieves the actual result at the time when the query is issued, the expiry time of the result given the current motion of the query and database objects, and the change that causes the expiration. A continuous query retrieves tuples of the form < result , interval >, where each result is accompanied by a future interval , during which it is valid. We study time-parameterized and continuous versions of the most common spatial queries (i.e., window queries, nearest neighbors, spatial joins), proposing efficient processing algorithms and accurate cost models.
32
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Nick Roussopoulos, Stephen Kelley, F. Vincent · 1995 · 1.4K citations · Full text
Jianjun Chen, David J. DeWitt, Feng Tian et al. · ACM SIGMOD Record · 2000 · 1K citations
Indexing the positions of continuously moving objects
Simonas Šaltenis, Christian S. Jensen, Scott T. Leutenegger et al. · ACM SIGMOD Record · 2000 · 916 citations