Voronoi-based aggregate nearest neighbor query processing in road networks

Authors:
Liang Zhu;Yinan Jing;Weiwei Sun;Dingding Mao;Peng Liu
Affiliations:
Fudan University, Shanghai, China;Fudan University, Shanghai, China;Fudan University, Shanghai, China;Fudan University, Shanghai, China;Fudan University, Shanghai, China
Venue:
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Year:
2010

Citing 5
Cited 3

Group Nearest Neighbor Queries

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Aggregate Nearest Neighbor Queries in Road Networks

IEEE Transactions on Knowledge and Data Engineering
Aggregate nearest neighbor queries in spatial databases

ACM Transactions on Database Systems (TODS)
Query processing in spatial network databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Single-Source multi-target a* algorithm for POI queries on road network

WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Merged aggregate nearest neighbor query processing in road networks

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Reverse top-k group nearest neighbor search

WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Aggregate nearest neighbor (ANN) query returns a common interesting data object that minimizes an aggregate distance for multiple query points. In this paper, we propose a novel approach to efficiently process ANN queries in road networks. This approach includes two processes: initializing process and pruning process, which are both based on computing kNN of query points in network Voronoi diagram. Experimental results show that our approach outperforms existing approaches on both response time and page accesses.