Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/43594
Title: Beyond millisecond latency kNN search on commodity machine
Authors: Liao, B
Leong, HU
Yiu, ML
Gong, Z
Keywords: Nearest neighbor searches
Overlay networks
Spatial databases
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on knowledge and data engineering, 2015, v. 27, no. 10, 2426702, p. 2618-2631 How to cite?
Journal: IEEE transactions on knowledge and data engineering 
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.
URI: http://hdl.handle.net/10397/43594
ISSN: 1041-4347 (print)
1558-2191 (online)
DOI: 10.1109/TKDE.2015.2426702
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
Citations as of Jul 14, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
Citations as of Jul 19, 2017

Page view(s)

14
Last Week
1
Last month
Checked on Jul 9, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.