HAPS： Supporting Effective and Efficient Full-Text P2P Search with Peer Dynamics

• Published in: Journal of computer science and technology 2010-05, Vol.25 (3), p.482-498
• Main Author: 任祖杰 陈珂 寿黎但 陈刚 贝毅君 李晓燕
• Format: Article
• Language: English
• Subjects: Accuracy; Architecture; Artificial Intelligence; Computer architecture; Computer Science; Data search; Data structures; Data Structures and Information Theory; Directories; Dynamical systems; Dynamics; HAPS; Information Systems Applications (incl.Internet); Keywords; Networks; P2P; Peer to peer computing; Peers; Performance degradation; Queries; Query processing; Regular Paper; Searching; Software Engineering; Tables (data); Theory of Computation; 全文检索; 分布式哈希表; 性能退化; 搜索技术; 搜索系统; 网络搜索
• ISSN: 1000-9000; 1860-4749
• DOI: 10.1007/s11390-010-9339-8

Recently, peer-to-peer （P2P） search technique has become popular in the Web as an alternative to centralized search due to its high scalability and low deployment-cost. However, P2P search systems are known to suffer from the problem of peer dynamics, such as frequent node join/leave and document changes, which cause serious performance degradation. This paper presents the architecture of a P2P search system that supports full-text search in an overlay network with peer dynamics. This architecture, namely HAPS, consists of two layers of peers. The upper layer is a DHT （distributed hash table） network interconnected by some super peers （which we refer to as hubs）. Each hub maintains distributed data structures called search directories, which could be used to guide the query and to control the search cost. The bottom layer consists of clusters of ordinary peers （called providers）, which can receive queries and return relevant results. Extensive experimental results indicate that HAPS can perform searches effectively and efficiently. In addition, the performance comparison illustrates that HAPS outperforms a fiat structured system and a hierarchical unstructured system in the environment with peer dynamics.