Efficient Searching for File Sharing in Peer to Peer With Repository Function &super Peer
Optimizing the search based on multi-keyword using Bloom Filter minimizes the traffic cost. Existing scheme gives the optimal setting of Bloom Filter to reduce the search traffic. Search traffic is further minimized by implementing repository function on server search side. The involved inverted list information, during search is temporally stored. Gathered information from stored results of query logs minimizes the search traffic, instead of whole query search throughout the network. Super Peer based P2P architecture minimize the processing time and latency by providing server for a set of clients. Cluster of server search makes the gathering of information fast to the main search server. The construction of repository function and Super Peer reduce the search traffic and latency.