Details

Autor(en) / Beteiligte

• 孙未未 陈楚南 朱良 高去君 荆一楠 李青

Titel

On Efficient Aggregate Nearest Neighbor Query Processing in Road Networks

Ist Teil von

• Journal of computer science and technology, 2015-07, Vol.30 (4), p.781-798

Ort / Verlag

New York: Springer US

Erscheinungsjahr

2015

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• An aggregate nearest neighbor （ANN） query returns a point of interest （POI） that minimizes an aggregate function for multiple query points. In this paper, we propose an e？cient approach to tackle ANN queries in road networks. Our approach consists of two phases： searching phase and pruning phase. In particular, we first continuously compute the nearest neighbors （NNs） for each query point in some specific order to obtain the candidate POIs until all query points find a common POI. Second, we filter out the unqualified POIs based on the pruning strategy for a given aggregate function. The two-phase process is repeated until there remains only one candidate POI, and the remained one is returned as the final result. In addition, we discuss the partition strategies for query points and the approximate ANN query for the case where the number of query points is huge. Extensive experiments using real datasets demonstrate that our proposed approach outperforms its competitors significantly in most cases.