Continually Answering Constraint k-NN Queries in Unstructured P2P Systems

作     者：王斌 杨晓春 王国仁 于戈 陈雷 王晓阳 林学民 

作者机构：College of Information Science and Engineering Northeastern University Department of Computer ScienceThe Hong Kong University of Science and Technology Department of Computer ScienceUniversity of Vermont Department of Computer ScienceThe University of New South Wales 

出 版 物：《Journal of Computer Science & Technology》 (计算机科学技术学报（英文版）)

年 卷 期：2008年第23卷第4期

页      面：538-556页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：the Program for New Century Excellent Talents in Universities(Grant No.NCET-06-0290) the National Natural Science Foundation of China(Grant Nos.60503036,and 60773221) the National High-Tech Development 863 Program of China(Grant No.2006AA09Z139) the Fok Ying Tong Education Foundation Award(Grant No.104027) 

主　　题：unstructured P2P k-NN queries answering queries constraints 

摘      要：We consider the problem of efficiently computing distributed geographical k-NN queries in an unstructured peer-to-peer （P2P） system, in which each peer is managed by an individual organization and can only communicate with its logical neighboring peers. Such queries are based on local filter query statistics, and require as less communication cost as possible which makes it more difficult than the existing distributed k-NN queries. Especially, we hope to reduce candidate peers and degrade communication cost. In this paper, we propose an efficient pruning technique to minimize the number of candidate peers to be processed to answer the k-NN queries. Our approach is especially suitable for continuous k-NN queries when updating peers, including changing ranges of peers, dynamically leaving or joining peers, and updating data in a peer. In addition, simulation results show that the proposed approach outperforms the existing Minimum Bounding Rectangle （MBR）-based query approaches, especially for continuous queries.