Continually Answering Constraint <Emphasis Type="Italic">k</Emphasis>-<Emphasis Type="Italic">NN</Emphasis> Queries in Unstructured P2P Systems |
| |
Authors: | Bin Wang Xiao-Chun Yang Guo-Ren Wang Ge Yu Lei Chen X Sean Wang Xue-Min Lin |
| |
Affiliation: | (1) College of Information Science and Engineering, Northeastern University, Shenyang, 110004, China;(2) Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong S.A.R., China;(3) Department of Computer Science, University of Vermont, Vermont, U.S.A.;(4) Department of Computer Science, The University of New South Wales, New South Wales, Australia |
| |
Abstract: | 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.
Electronic supplementary material The online version of this article (doi:) contains supplementary material, which is available to authorized users.
Supported by 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), and the Fok Ying Tong Education Foundation Award (Grant No. 104027). |
| |
Keywords: | unstructured P2P k-NN queries answering queries constraints |
本文献已被 维普 SpringerLink 等数据库收录! |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
|