P2P Web Search Research Articles

Mobile IoT device summarizer using P2P web search engine and inherent characteristic of contents

Grasping the sense of web pages on small screen of mobile devices is too difficult, so mobile users prefer summarized reports. One popular technique to generate automatic summarized report is based on vector model. The vector model summarization methods are simple and low cost to implement on mobile devices. However, the quality of summarized reports of the model may not be good because there is a semantic difference between manual summarized reports and the machine summarized reports. In addition, the censored documents of the centralized search engine cannot accurately reflect the query of user in the summary results. To overcome this constraints, automatic mobile device summarizer using a semantic feature of pseudo relevance feedback and P2P web search engine is proposed. The proposed method increases the quality of summarized reports by using the latent features of documents and clustering technique. The method uses none censored documents of the P2P web search engine to more accurately reflect user requirements in summarized reports. The automatic summarizer consists of a server-side containerized auto-summary module for flexible management of the summarization functions and a user-side mobile device module to reduce the overload of the mobile device.

Retrieval of Fresh Information Using P2P Network

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.

P2P Web Search Technology

Web搜索引擎已经成为人们从海量Web信息中快速找到所需信息的重要工具,随着Web数据量的爆炸性增长,传统的集中式搜索引擎已经越来越不能满足人们不断增长的信息获取需求.随着对等网络(peer-to-peer,简称P2P)技术的快速发展,人们提出了基于P2P的Web搜索技术并迅速成为研究热点.研究的目的是对现有的基于P2P的Web搜索技术进行总结,以期为进一步研究指明方向.首先分析了基于P2P的Web搜索面临的诸多挑战;然后重点总结分析了基于P2P的Web搜索的各项关键技术的研究现状,包括系统拓扑结构、数据存放策略、查询路由机制、索引切分策略、数据集选择、相关性排序、网页收集方法等;最后对已有的3个较有特色的基于P2P的Web搜索原型系统进行了介绍.;Web search engine has become a very important tool for finding information efficiently from the massive Web data. With the explosive growth of the Web data, traditional centralized search engines become harder to catch up with the growing step of people's information needs. With the rapid development of peer-to-peer (P2P) technology, the notion of P2P Web search has been proposed and quickly becomes a research focus. The goal of this paper is to give a brief summary of current P2P Web search technologies in order to facilitate future research. First, some main challenges for P2P Web search are presented. Then, key techniques for building a feasible and efficient P2P Web search engine are reviewed, including system topology, data placement, query routing, index partitioning, collection selection, relevance ranking and Web crawling. Finally, three recently proposed novel P2P Web search prototypes are introduced.