Spatial inverse query processing |
| |
Authors: | Thomas Bernecker Tobias Emrich Hans-Peter Kriegel Nikos Mamoulis Matthias Renz Shiming Zhang Andreas Züfle |
| |
Affiliation: | 1. Institute for Informatics, Ludwig-Maximilians-Universit?t München, Oettingenstr. 67, 80538, München, Germany 2. Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong, Hong Kong
|
| |
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. Furthermore, we show how to relax the definition of inverse queries in order to ensure non-empty result sets. Our experiments show that our framework is significantly more efficient than naive approaches. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|