Chora: Expert-Based P2P Web Search

Authors:
Halldor Isak Gylfason;Omar Khan;Grant Schoenebeck
Affiliations:
Electrical Engineering and Computer Science, University of California, Berkeley,;Electrical Engineering and Computer Science, University of California, Berkeley,;Electrical Engineering and Computer Science, University of California, Berkeley,
Venue:
Agents and Peer-to-Peer Computing
Year:
2006

Citing 7
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Towards a Fully Distributed P2P Web Search Engine

FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
OpenDHT: a public DHT service and its uses

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
MINERVA: collaborative P2P search

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Querying the internet with PIER

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Database selection and result merging in P2P web search

DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
On using histograms as routing indexes in peer-to-peer systems

DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present Chora, a P2P web search engine which complements, not replaces, traditional web search by using peers' web viewing history to recommend useful web sites to queriers. Chorais designed around a two-step paradigm. First, Choradetermines which peers to query and then it executes a query across these peers. Each peer uses a desktop search engine to query their local web history and retrieve results ordered by relevance. To determine which peers to query, a small sketch of the information available from each peer is stored in a DHT. Peers with sketches indicating that they may have relevant information are queried. The query is dispersed through an ad hoc network connecting only those machines in the query and is optimized for getting good results as quickly as possible.