Location-based spatial queries
Top Cited Papers
- 9 June 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 443-454
- https://doi.org/10.1145/872757.872812
Abstract
In this paper we propose an approach that enables mobile clients to determine the validity of previous queries based on their current locations. In order to make this possible, the server returns in addition to the query result, a validity region around the client's location within which the result remains the same. We focus on two of the most common spatial query types, namely nearest neighbor and window queries, define the validity region in each case and propose the corresponding query processing algorithms. In addition, we provide analytical models for estimating the expected size of the validity region. Our techniques can significantly reduce the number of queries issued to the server, while introducing minimal computational and network overhead compared to traditional spatial queries.Keywords
This publication has 12 references indexed in Scilit:
- Time-parameterized queries in spatio-temporal databasesPublished by Association for Computing Machinery (ACM) ,2002
- Poisson Voronoi DiagramsPublished by Wiley ,2000
- A cost model for query processing in high dimensional data spacesACM Transactions on Database Systems, 2000
- Efficient cost models for spatial queries using R-treesIEEE Transactions on Knowledge and Data Engineering, 2000
- Distance browsing in spatial databasesACM Transactions on Database Systems, 1999
- Multidimensional access methodsACM Computing Surveys, 1998
- Voronoi DiagramsPublished by Springer Nature ,1997
- Nearest neighbor queriesPublished by Association for Computing Machinery (ACM) ,1995
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990