Date Added: May 2012
Peer-to-peer systems are mainly used for object sharing and file sharing, but they can provide the infrastructure for many other applications. These systems need an algorithm to evaluate the queries efficiently so that the best of the results can be achieved in data sharing and message passing. The delay in the query can be caused by scale of the system and the size of the query space. In this project an efficient query processing scheme is proposed to limit the search space of the given query by a domain based query routing mechanism which limits the search to related peers. Therefore, the mechanism consists of domain based architecture for grouping peers in the network into domains based on their contents.