Peer-to-Peer Keyword Search Using Keyword Relationship

نویسندگان

  • Kiyohide Nakauchi
  • Yuichi Ishikawa
  • Hiroyuki Morikawa
  • Tomonori Aoyama
چکیده

Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for Internet-scale information retrieval and search systems because they require neither any centralized directory nor any centralized management of overlay network topology and data placement. However, due to this decentralized architecture, current P2P keyword search systems lack useful global knowledge such as popularity of data items and relationships between keywords and data items. As a result, current P2P keyword search systems supports only naive text-match search and can find only data items with a keyword (or meta-data) exactly indicated in a query. In this paper, we show an efficient P2P search system which increases possibility of discovering desired data items. The key mechanism is query expansion, where a received query is expanded based on keyword relationships managed in a distributed fashion by participating nodes. Keyword relationships are improved through search and retrieval processes and each relashionship is shared among nodes holding similar data items. We also present implementation of our P2P search system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Evaluation and Comparison of Current Peer-to-Peer Full-Text Keyword Search Techniques

Current peer-to-peer (p2p) full-text keyword search techniques fall into the following categories: document-based partitioning, keyword-based partitioning, hybrid indexing, and semantic search. This paper provides a performance evaluation and comparison of these p2p full-text keyword search techniques on a dataset with 3.7 million web pages and 6.8 million search queries. Our evaluation results...

متن کامل

Design and Implementation of a Semantic Peer-to-Peer Network

Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for large-scale information retrieval and search systems due to scalability, fault-tolerance, and self-organizing nature. This decentralized architecture, however, makes it difficult for traditional P2P networks to globally share useful semantic knowledge among nodes. As a result, traditional P2P networks...

متن کامل

Distributed Suffix Tree for Peer-to-Peer Search

Establishing an appropriate semantic overlay on Peer-to-Peer networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limited in their ability to support semantic search. This paper proposes the DST (Distributed Suffix Tree) overlay as the intermediate layer between the DHT overlay and the semantic overlay. The DST overlay supports search of ke...

متن کامل

Effective Multi Keyword Search over P2p Network Using Optimized Bloom Filter Settings

P2P network is a popular technology used for sharing and searching files on the computers connected to the network. Current search mechanisms of peer-to-peer (P2P) systems can well handle a single keyword search problem. Other than single keyword search, multi keyword search is very popular and useful in many file sharing applications. For multi keyword search, the solution which merges the res...

متن کامل

Document Clustering for Distributed Fulltext Search

Recent research efforts in peer-to-peer (P2P) systems concentrate on providing a “distributed hash table”-like primitive in the P2P system (Stoica et al., 2001). However, to make P2P systems useful, we need to build a keyword search engine to index the entire document collection in the distributed system. Doing keyword search in a distributed environment poses new challenges for traditional inf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003