DocumentCode :
783623
Title :
Aggregate nearest neighbor queries in road networks
Author :
Yiu, Man Lung ; Mamoulis, Nikos ; Papadias, Dimitris
Author_Institution :
Dept. of Comput. Sci., Hong Kong Univ., China
Volume :
17
Issue :
6
fYear :
2005
fDate :
6/1/2005 12:00:00 AM
Firstpage :
820
Lastpage :
833
Abstract :
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.
Keywords :
geographic information systems; minimisation; query processing; roads; trees (mathematics); visual databases; GIS; aggregate distance function; aggregate nearest neighbor queries; geographic information systems; location-based services; network distance materialization structures; query processing; road networks; spatial access methods; spatial databases; spatial objects; Aggregates; Computer networks; Costs; Euclidean distance; Geographic Information Systems; Intelligent networks; Lungs; Nearest neighbor searches; Roads; Spatial databases; Index Terms- Query processing; location-dependent and sensitive.; spatial databases; spatial databases and GIS;
fLanguage :
English
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
1041-4347
Type :
jour
DOI :
10.1109/TKDE.2005.87
Filename :
1423982
Link To Document :
بازگشت