Efficient construction of safe regions for moving kNN queries over dynamic datasets

Publication Type:
Conference Proceeding
Citation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009, 5644 LNCS pp. 373 - 379
Issue Date:
2009-11-02
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013005470OK.pdf212.43 kB
Adobe PDF
The concept of safe region has been used to reduce the computation and communication cost for the continuous monitoring of k nearest neighbor (kNN) queries. A safe region is an area such that as long as a query remains in it, the set of its kNNs does not change. In this paper, we present an efficient technique to construct the safe region by using cheap RangeNN queries. We also extend our approach for dynamic datasets (the objects may appear or disappear from the dataset). Our proposed algorithm outperforms existing algorithms and scales better with the increase in k. © 2009 Springer Berlin Heidelberg.
Please use this identifier to cite or link to this item: