2007 IEEE 23rd International Conference on Data Engineering (2007)
Apr. 15, 2007 to Apr. 20, 2007
Man Lung Yiu , Department of Computer Science, Aalborg University, DK-9220 Aalborg, Denmark. email@example.com
Xiangyuan Dai , Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong. firstname.lastname@example.org
Nikos Mamoulis , Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong. email@example.com
Michail Vaitis , Department of Geography, University of the Aegean, Mytilene, Greece. firstname.lastname@example.org
A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, consider a real estate agency office that holds a database with available 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 a distance range from them. In this paper, we formally define spatial preference queries and propose appropriate indexing techniques and search algorithms for them. Our methods are experimentally evaluated for a wide range of problem settings.
M. Vaitis, X. Dai, M. L. Yiu and N. Mamoulis, "Top-k Spatial Preference Queries," 2007 IEEE 23rd International Conference on Data Engineering(ICDE), Istanbul, Turkey, 2007, pp. 1076-1085.