Open Access Open Access  Restricted Access Subscription or Fee Access

Retrieval of Fresh Information Using P2P Network

A. Suresh, C. Pabitha


The fast development of the World Wide Web and Dynamic nature makes it a challenge for searching and retrieving of information that is more recent .The WWW is a rapidly growing and changing information source. Its growth and change rates make the task of finding recent information harder. The exponentially growing information published on the Web relies largely on a few major search engines like Google to be brought to the public nowadays. In fact, the increasing dynamics of the information distributed on the Internet challenge the flexibility of these centralized search engines. However, such an engine is not suitable for fresh information retrieval because it spends a long time to collect web pages by using a web robot (or crawler). In the other hand, there are some distributed search engines such as Cooperative Search Engine (CSE), and so on. However, these distributed search engines are able to update in a very short time, e.g. a few minutes. But it has more communication delay. In this paper, in order to reduce the delay we proposed a P2P Web search that connects an a-priori unlimited number of peers, each of which maintains a personal local database and a local search facility. Each peer posts a small amount of metadata to a physically distributed directory layered on top of a DHT-based overlay network that is used to efficiently select promising peers from across the peer population that can best locally execute a query. Further usage of Apriori algorithm and Page Rank algorithm improves mining of frequently viewed documents to greater extent. We also uses Textual Entailment approach for searching a relevant document for a given keyword ie) to retrieve not only textual documents that have specified keywords, but also to discover semantically equivalent or entailed documents from given keywords.


Information Retrieval, P2P Network, Cooperative Search Engine, DHT, Textual Entailment.

Full Text:



M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. Improving collection selection with overlap awareness in p2p search engines. In SIGIR, 2005.

M. Bender, S. Michel, G. Weikum, and C. Zimmer. The minerva project: Database selection in the context of p2p search. In BTW, pages 125–144, 2005.

Bookmark-nduced Gathering of Information with Adaptive Classification into Personalized Ontologies.

J. Callan. Distributed information retrieval. Advances in information retrieval, Kluwer Academic Publishers., pages 127–150, 2000.

R. Huebsch, J. M. Hellerstein, N. Lanham, B. T. Loo, S. Shenker, and I. Stoica. Querying the internet with pier. In VLDB, pages 321–332, 2003.

J. Li, B. Loo, J. Hellerstein, F. Kaashoek, D. Karger, and R. Morris. On the feasibility of peer-to-peer web indexing and search. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003.

H. Nottelmann and N. Fuhr. Evaluating different methods of estimating retrieval quality for resource selection. In SIGIR2003, pages 290–297. ACM Press, 2003.

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In SIGCOMM, pages 161–172. ACM Press, 2001.

Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In IFIP/ACM Middleware, pages 329–350, 2001.

Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM, pages E3149–160. ACM Press, 2001.



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.