Group Nearest Neighbor Queries

  • Authors:
  • Dimitris Papadias;Qiongmao Shen;Yufei Tao;Kyriakos Mouratidis

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ICDE '04 Proceedings of the 20th International Conference on Data Engineering
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given two sets of points P and Q, a group nearest neighbor(GNN) query retrieves the point(s) of P with the smallestsum 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 queryreturns the data point p that minimizes the sum of Euclideandistances |pqi| for 1驴i 驴3. Assuming that Q fits in memoryand P is indexed by an R-tree, we propose severalalgorithms for finding the group nearest neighborsefficiently. As a second step, we extend our techniques forsituations where Q cannot fit in memory, covering bothindexed and non-indexed query points. An experimentalevaluation identifies the best alternative based on the dataand query properties.