Based on the Half-space Pruning to Continuously Monitoring Reverse KNN

摘要：

　　Reverse k Nearest Neighbor (RKNN) query is proposed based on the k Nearest Neighbor (KNN) query,which can be used to evaluate the influence of the query objects.At present RKNN query algorithms are mostly based on static or continuous objects,however,with the widespread of mobile device,algorithms for efficiently answering queries about large populations of moving objects are gaining interest.Given a group of nearby space objects as the query input,the authors propose the continuously monitoring RKNN algorithms based on the half-space pruning,compute the minimal enclosing circle containing the query objects and consider the objects in the circle as a whole.Then,in order to get the querys final RKNN results,we design a filter method based on R-tree and a refinement process to realize continuous RKNN monitoring.

关键词： Half-space Pruning RKNN Continuously Monitoring minimal enclosing circle

作者: Du Xuedong Xie Tingting

作者单位: College of Information Science and Engineering Shandong University of science and technology,Qingdao 266510,China

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer Application and System Modeling(2012第二届计算机应用与系统建模国际会议)(ICCASM-2012)

会议地点: 沈阳

会议语种:英文

页码: 1527-1531

在线出版日期: 2012-07-27（万方平台首次上网日期，不代表论文的发表时间）