Given two spatial datasets P (e.g., facilities) and Q (queries), an aggregate nearest neighbor (ANN) query retrieves the point(s) of P with the smallest aggregate distance(s) to points in Q. Assuming, for example, n users at locations q1,...qn, an ANN query outputs the facility p belongs to P that minimizes the sum of distances |pqi| for 1 is less than or equal to i is less than or equal to n that the users have to travel in order to meet there. Similarly, another ANN query may report the point p belongs to P that minimizes the maximum distance that any user has to travel, or the minimum distance from some user to his/her closest facility. If Q fits in memory and P is indexed by an R-tree, we develop algorithms for aggregate nearest neighbors that capture several versions of the problem, including weighted queries and incremental reporting of results. Then, we analyze their performance and propose cost models for query optimization. Finally, we extend our techniques for disk-resident queries and approximate ANN retrieval. The efficiency of the algorithms and the accuracy of the cost models are evaluated through extensive experiments with real and synthetic datasets.
Aggregation, Nearest neighbor queries, Spatial database, weighted queries
Databases and Information Systems | Numerical Analysis and Scientific Computing | Theory and Algorithms
Data Management and Analytics
ACM Transactions on Database Systems
PAPADIAS, Dimitris; TAO, Yufei; MOURATIDIS, Kyriakos; and HUI, Chun Kit.
Aggregate Nearest Neighbor Queries in Spatial Databases. (2005). ACM Transactions on Database Systems. 30, (2), 529-576. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/175
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.