Provided by: International Journal on Computer Science and Technology (IJCST)
Topic: Data Management
Date Added: Sep 2012
In this paper, the authors formally define spatial preference queries and propose appropriate indexing techniques and search algorithms for them. Extensive evaluation of their methods on both real and synthetic data reveals that an optimized branch-and-bound solution is efficient and robust with respect to different parameters a spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, using a real estate agency database of flats for lease, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, cafes, hospital, market, etc.) within their spatial neighborhood.