English

Inverse Queries For Multidimensional Spaces

Databases 2011-05-06 v2

Abstract

Traditional spatial queries return, for a given query object qq, all database objects that satisfy a given predicate, such as epsilon range and kk-nearest neighbors. This paper defines and studies {\em inverse} spatial queries, which, given a subset of database objects QQ and a query predicate, return all objects which, if used as query objects with the predicate, contain QQ in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We show how to apply this framework on a variety of inverse queries, using appropriate space pruning strategies. In particular, we propose solutions for inverse epsilon range queries, inverse kk-nearest neighbor queries, and inverse skyline queries. Our experiments show that our framework is significantly more efficient than naive approaches.

Keywords

Cite

@article{arxiv.1103.0172,
  title  = {Inverse Queries For Multidimensional Spaces},
  author = {Thomas Bernecker and Tobias Emrich and Hans-Peter Kriegel and Nikos Mamoulis and Matthias Renz and Shiming Zhang and Andreas Züfle},
  journal= {arXiv preprint arXiv:1103.0172},
  year   = {2011}
}
R2 v1 2026-06-21T17:33:35.414Z