| Continually Answering Constraint k-NN Queries in Unstructured P2P Systems |
| |
| 作者单位： | College of Information Science and Engineering Northeastern University，Department of Computer Science，The Hong Kong University of Science and Technology，Department of Computer Science，University of Vermont，Department of Computer Science，The University of New South Wales |
| |
| 基金项目： | the Program [or New Century Excellent Talents in Universities，国家自然科学基金，国家高技术研究发展计划(863计划)，the Fok Ying Tong Education Foundation Award |
| |
| 摘 要： | 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.
|
Continually Answering Constraint k-NN Queries in Unstructured P2P Systems |
| |
| Authors: | Bin Wang Xiao-Chun Yang Guo-Ren Wang Ge Yu Lei Chen X Sean Wang Xue-Min Lin |
| |
| 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. |
| |
| Keywords: | unstructured P2P k-NN queries answering queries constraints |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
