Aggregate nearest neighbor queries in road networks

Man Lung Yiu, Nikos Mamoulis, Dimitris Papadias

Research output: Journal article publicationJournal articleAcademic researchpeer-review

175 Citations (Scopus)


Aggregate nearest neighbor queries return the object that minimizes an aggregate distance function with respect to a set of query points. Consider, for example, several users at specific locations (query points) that want to find the restaurant (data point), which leads to the minimum sum of distances that they have to travel in order to meet. We study the processing of such queries for the case where the position and accessibility of spatial objects are constrained by spatial (e.g., road) networks. We consider alternative aggregate functions and techniques that utilize Euclidean distance bounds, spatial access methods, and/or network distance materialization structures. Our algorithms are experimentally evaluated with synthetic and real data. The results show that their relative performance depends on the problem characteristics.
Original languageEnglish
Pages (from-to)820-833
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Issue number6
Publication statusPublished - 1 Jun 2005
Externally publishedYes


  • Location-dependent and sensitive
  • Query processing
  • Spatial databases
  • Spatial databases and GIS

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'Aggregate nearest neighbor queries in road networks'. Together they form a unique fingerprint.

Cite this