Performance of Bloom Filter for Multikey Word Search

In peer to peer network retrieval mechanisms provide a scalable distributed hash table (DHT) that store keywords and the location of document. It allows every individual keyword to be mapped to a set of documents. Earlier Schemes single keyword based index, a list of entries for each keyword in a query can be retrieved by using existing DHT lookups. For multi keyword search, it increases the traffic and latency it performance is not effective So, Searching of multiple keyword is the became a challenging one. Commonly utilize Bloom Filter to overcome the traffic cost. It's not effective for the large storage system. So, In this paper we optimize the setting of bloom filter encoding mechanism, by increasing the bit array size and number of hash function. From this we can minimize the false positive rate.