Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems

— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it is not clear which architecture is better for full text search. This paper provides a quantitative comparison of full text keyword search in structured and unstructured P2P systems. We examine three techniques (and optimizations to those techniques) proposed in the literature: using a DHT along with inverted lists and Bloom filters; using a super-peer network; and using a random walk over an unstructured network. We use real Web documents and user queries to measure the cost for both document publishing and query processing, in terms of bandwidth and response time. Our results show that all three techniques use roughly the same bandwidth to process queries (with the super-peer technique having a slight edge). The structured network provides the best response time (30 percent better than a super-peer network...

• Type: Conference
• Year: 2006
• Where: INFOCOM
• Authors: Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Cooper
• Keywords: Communications, INFOCOM 2006, Random Walks, Super-peer Network, Unstructured P2p Systems