Inverse Queries for Multidimensional Spaces

  • Thomas Bernecker
  • Tobias Emrich
  • Hans-Peter Kriegel
  • Nikos Mamoulis
  • Matthias Renz
  • Shiming Zhang
  • Andreas Züfle
Conference paper

DOI: 10.1007/978-3-642-22922-0_20

Volume 6849 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bernecker T. et al. (2011) Inverse Queries for Multidimensional Spaces. In: Pfoser D. et al. (eds) Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg

Abstract

Traditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database objects Q and a query predicate, return all objects which, if used as query objects with the predicate, contain Q 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 k-nearest neighbor queries, and inverse skyline queries. Our experiments show that our framework is significantly more efficient than naive approaches.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thomas Bernecker
    • 1
  • Tobias Emrich
    • 1
  • Hans-Peter Kriegel
    • 1
  • Nikos Mamoulis
    • 2
  • Matthias Renz
    • 1
  • Shiming Zhang
    • 2
  • Andreas Züfle
    • 1
  1. 1.Institute for InformaticsLudwig-Maximilians-Universität MünchenMünchenGermany
  2. 2.Department of Computer ScienceUniversity of Hong KongHong Kong