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. © 2011 Springer-Verlag.
CITATION STYLE
Bernecker, T., Emrich, T., Kriegel, H. P., Mamoulis, N., Renz, M., Zhang, S., & Züfle, A. (2011). Inverse queries for multidimensional spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6849 LNCS, pp. 330–347). https://doi.org/10.1007/978-3-642-22922-0_20
Mendeley helps you to discover research relevant for your work.