Paper Info
Title
Insq: An Influential Neighbor Set Based Moving Knn Query Processing System
Abstract
We revisit the moving k nearest neighbor (MkNN) query, which computes one's k nearest neighbor set and maintains it while at move. Existing MkNN algorithms are mostly safe region based, which lack efficiency due to either computing small safe regions with a high recomputation frequency or computing larger safe regions but with a high cost for each computation. In this demonstration, we showcase a system named INSQ that adopts a novel algorithm called the Influential Neighbor Set (INS) algorithm to process the MkNN query in both two-dimensional Euclidean space and road networks. This algorithm uses a small set of safe guarding objects instead of safe regions. As long as the the current k nearest neighbors are closer to the query object than the safe guarding objects are, the current k nearest neighbors stay valid and no recomputation is required. Meanwhile, the region defined by the safe guarding objects is the largest possible safe region. This means that the recomputation frequency is also minimized and hence, the INS algorithm achieves high overall query processing efficiency.
Year
Venue
DocType
2016
2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE)
Conference
Volume
ISSN
Citations 
abs/1602.00363
1084-4627
2
PageRank 
References 
Authors
0.36
4
6
Name
Order
Citations
PageRank
Chuanwen Li1489.53
Yu Gu220134.98
Jianzhong Qi317116.11
Ge YU41313175.88
Rui Zhang530822.87
Qingxu Deng636146.24