Proof: A Novel DHT-Based Peer-to-Peer Search Engine

Kai-Hsiang YANG; Jan-Ming HO

doi:10.1093/ietcom/e90-b.4.817

Proof: A Novel DHT-Based Peer-to-Peer Search Engine

Kai-Hsiang YANG, Jan-Ming HO

Full Text Views

0

Cite this

Summary :

In this paper we focus on building a large scale keyword search service over structured Peer-to-Peer (P2P) networks. Current state-of-the-art keyword search approaches for structured P2P systems are based on inverted list intersection. However, the biggest challenge in those approaches is that when the indices are distributed over peers, a simple query may cause a large amount of data to be transmitted over the network. We propose in this paper a new P2P keyword search scheme, called "Proof," which aims to reduce the network traffic generated during the intersection process. We applied three main ideas in Proof to reduce network traffic, including (1) using a sorted query flow, (2) storing content summaries in the inverted lists, and (3) setting a stop condition for the checking of content summaries. We also discuss the advantages and limitations of Proof, and conducted extensive experiments to evaluate the search performance and the quality of search results. Our simulation results showed that, compared with previous solutions, Proof can dramatically reduce network traffic while providing 100% precision and high recall of search results, at some additional storage overhead.

Publication: IEICE TRANSACTIONS on Communications Vol.E90-B No.4 pp.817-825

Publication Date: 2007/04/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e90-b.4.817

Type of Manuscript: Special Section PAPER (Special Section on Networks Software)

Category

Cite this

Copy

Kai-Hsiang YANG, Jan-Ming HO, "Proof: A Novel DHT-Based Peer-to-Peer Search Engine" in IEICE TRANSACTIONS on Communications, vol. E90-B, no. 4, pp. 817-825, April 2007, doi: 10.1093/ietcom/e90-b.4.817.
Abstract: In this paper we focus on building a large scale keyword search service over structured Peer-to-Peer (P2P) networks. Current state-of-the-art keyword search approaches for structured P2P systems are based on inverted list intersection. However, the biggest challenge in those approaches is that when the indices are distributed over peers, a simple query may cause a large amount of data to be transmitted over the network. We propose in this paper a new P2P keyword search scheme, called "Proof," which aims to reduce the network traffic generated during the intersection process. We applied three main ideas in Proof to reduce network traffic, including (1) using a sorted query flow, (2) storing content summaries in the inverted lists, and (3) setting a stop condition for the checking of content summaries. We also discuss the advantages and limitations of Proof, and conducted extensive experiments to evaluate the search performance and the quality of search results. Our simulation results showed that, compared with previous solutions, Proof can dramatically reduce network traffic while providing 100% precision and high recall of search results, at some additional storage overhead.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.4.817/_p

Copy

@ARTICLE{e90-b_4_817,
author={Kai-Hsiang YANG, Jan-Ming HO, },
journal={IEICE TRANSACTIONS on Communications},
title={Proof: A Novel DHT-Based Peer-to-Peer Search Engine},
year={2007},
volume={E90-B},
number={4},
pages={817-825},
abstract={In this paper we focus on building a large scale keyword search service over structured Peer-to-Peer (P2P) networks. Current state-of-the-art keyword search approaches for structured P2P systems are based on inverted list intersection. However, the biggest challenge in those approaches is that when the indices are distributed over peers, a simple query may cause a large amount of data to be transmitted over the network. We propose in this paper a new P2P keyword search scheme, called "Proof," which aims to reduce the network traffic generated during the intersection process. We applied three main ideas in Proof to reduce network traffic, including (1) using a sorted query flow, (2) storing content summaries in the inverted lists, and (3) setting a stop condition for the checking of content summaries. We also discuss the advantages and limitations of Proof, and conducted extensive experiments to evaluate the search performance and the quality of search results. Our simulation results showed that, compared with previous solutions, Proof can dramatically reduce network traffic while providing 100% precision and high recall of search results, at some additional storage overhead.},
keywords={},
doi={10.1093/ietcom/e90-b.4.817},
ISSN={1745-1345},
month={April},}

Copy

TY - JOUR
TI - Proof: A Novel DHT-Based Peer-to-Peer Search Engine
T2 - IEICE TRANSACTIONS on Communications
SP - 817
EP - 825
AU - Kai-Hsiang YANG
AU - Jan-Ming HO
PY - 2007
DO - 10.1093/ietcom/e90-b.4.817
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2007
AB - In this paper we focus on building a large scale keyword search service over structured Peer-to-Peer (P2P) networks. Current state-of-the-art keyword search approaches for structured P2P systems are based on inverted list intersection. However, the biggest challenge in those approaches is that when the indices are distributed over peers, a simple query may cause a large amount of data to be transmitted over the network. We propose in this paper a new P2P keyword search scheme, called "Proof," which aims to reduce the network traffic generated during the intersection process. We applied three main ideas in Proof to reduce network traffic, including (1) using a sorted query flow, (2) storing content summaries in the inverted lists, and (3) setting a stop condition for the checking of content summaries. We also discuss the advantages and limitations of Proof, and conducted extensive experiments to evaluate the search performance and the quality of search results. Our simulation results showed that, compared with previous solutions, Proof can dramatically reduce network traffic while providing 100% precision and high recall of search results, at some additional storage overhead.
ER -