TY - GEN
T1 - V*-kNN
T2 - 25th IEEE International Conference on Data Engineering, ICDE 2009
AU - Nutanong, Sarana
AU - Zhang, Rui
AU - Tanin, Egemen
AU - Kulik, Lars
PY - 2009
Y1 - 2009
N2 - This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region concept called the V*-Diagram. By incrementally maintaining the V*-Diagram, V*-kNN continuously provides accurateMkNN query results and supports dynamically changing values of k. Our approach exploits information regarding the current location of the query point and the search space in addition to the data objects. As a result, the V*-kNN has much smaller IO and computation costs than existing methods. © 2009 IEEE.
AB - This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region concept called the V*-Diagram. By incrementally maintaining the V*-Diagram, V*-kNN continuously provides accurateMkNN query results and supports dynamically changing values of k. Our approach exploits information regarding the current location of the query point and the search space in addition to the data objects. As a result, the V*-kNN has much smaller IO and computation costs than existing methods. © 2009 IEEE.
UR - http://www.scopus.com/inward/record.url?scp=67649661809&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-67649661809&origin=recordpage
U2 - 10.1109/ICDE.2009.63
DO - 10.1109/ICDE.2009.63
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9780769535456
SP - 1519
EP - 1522
BT - Proceedings - International Conference on Data Engineering
Y2 - 29 March 2009 through 2 April 2009
ER -