The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2015 vol. 27)
ISSN: 1041-4347
pp: 2618-2631
Bailong Liao , Department of Computer and Information Science, University of Macau, Macau
Leong Hou U , Department of Computer and Information Science, University of Macau, Macau
Man Lung Yiu , Department of Computer and Information Science, University of Macau, Macau
Zhiguo Gong , Department of Computing, Hong Kong Polytechnic University, Hong Kong
ABSTRACT
The $_$k$_$ nearest neighbor ($_$k$_$ NN) search on road networks is an important function in web mapping services. These services are now dealing with rapidly arriving queries, that are issued by a massive amount of users. While overlay graph-based indices can answer shortest path queries efficiently, there have been no studies on utilizing such indices to answer $_$k$_$ NN queries efficiently. In this paper, we fill this research gap and present two efficient $_$k$_$ NN search solutions on overlay graph-based indices. Experimental results show that our solutions offer very low query latency (0.1 ms) and require only small index sizes, even for 10-million-node networks.
INDEX TERMS
Roads, Indexes, Search problems, Time factors, Bidirectional control, Contracts, Servers
CITATION

B. Liao, L. H. U, M. L. Yiu and Z. Gong, "Beyond Millisecond Latency $k$ NN Search on Commodity Machine," in IEEE Transactions on Knowledge & Data Engineering, vol. 27, no. 10, pp. 2618-2631, 2015.
doi:10.1109/TKDE.2015.2426702
323 ms
(Ver 3.3 (11022016))