Issue No. 03 - March (2011 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.119
Man Lung Yiu , Hong Kong Politechnic University, Hong Kong
Hua Lu , Aalborg University, Aalborg
Nikos Mamoulis , University of Hong Kong, Hong Kong
Michail Vaitis , University of the Aegean, Mytilene
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. Such a neighborhood concept can be specified by the user via different functions. It can be an explicit circular region within a given distance from the flat. Another intuitive definition is to assign higher weights to the features based on their proximity to the flat. In this paper, we formally define spatial preference queries and propose appropriate indexing techniques and search algorithms for them. Extensive evaluation of our methods on both real and synthetic data reveals that an optimized branch-and-bound solution is efficient and robust with respect to different parameters.
Query processing, spatial databases.
H. Lu, M. L. Yiu, M. Vaitis and N. Mamoulis, "Ranking Spatial Data by Quality Preferences," in IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 433-446, 2010.