Evaluating methods of peer-to-peer keyword search Himanshu Khurana and Clive Leung This paper focuses on the evaluation of the fundamental costs and constraints on P2P full-text keyword search, and discusses the applications of such techniques including the web and file storage system. Two classes of keyword search techniques are in use or have been proposed in a P2P environment: flooding of queries over an overlay network as in Gnutella, and intersection of index lists stored in a distributed hash table. Our evaluation focuses on the latter one. Our project will be consisted of the following parts: 1. Survey of the peer-to-peer keyword search techniques to understand the pros and cons of the existing methods. 2. In addition to surveying the current methods, we are interested in whether we can revise the current methods to improve its effectiveness in terms of a practical set of attributes. 3. Design and implement a system to evaluate the effectiveness of the methods, and identify important attributes that can describe the tradeoff made in using the method. 4: Two important parameters that we will consider for evaluation will be: (1) Latency in responding to a client query. (2) Size of data transfer required to answer a query.