Conference Proceeding Article
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, three users at locations q1 , q2 and q3 that want to find a meeting point (e.g., a restaurant); the corresponding query returns the data point p that minimizes the sum of Euclidean distances |pqi| for 1 ≤i ≤3. Assuming that Q fits in memory and P is indexed by an R-tree, we propose several algorithms for finding the group nearest neighbors efficiently. As a second step, we extend our techniques for situations where Q cannot fit in memory, covering both indexed and non-indexed query points. An experimental evaluation identifies the best alternative based on the data and query properties.
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
ICDE 2004: 20th IEEE International Conference on Data Engineering: Proceedings: 30 March-2 April, 2004, Boston
IEEE Computer Society
City or Country
Los Alamitos, CA
PAPADIAS, Dimitris; SHEN, Qiongmao; TAO, Yufei; and MOURATIDIS, Kyriakos.
Group Nearest Neighbor Queries. (2004). ICDE 2004: 20th IEEE International Conference on Data Engineering: Proceedings: 30 March-2 April, 2004, Boston. 301-312. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/882
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.