Keyword Search in DHT-Based Peer-to-Peer Networks

摘要

DHT(Distributed Hash Table) provides a very effective and reliable search scheme in P2P networks. However, when the search involves a multiple-keyword query, it suffers heavy network traffic due to the passing around of a large inverted list among P2P nodes. In this paper, we propose Distance-Based Pruning technique to cut down the size of the inverted list considerably. It utilizes the concept of distance between keywords in the query and removes those entries in the inverted list that are going to be dropped sooner or later. We prove this prediction is accurate and effective such that it reduces the size of the inverted list by 29%.