English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search

Weikum, G., Bast, H., Canright, G., Hales, D., Schindelhauer, C., & Triantafillou, P. (2005). Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In European Conference on Complex Systems (ECCS '05) Workshop on Peer-to-peer Data Management in the Complex Systems Perspective (pp. 7-24). Paderborn: University of Paderborn, Heinz Nixdorf Institute.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Weikum, Gerhard1, Author           
Bast, Holger2, Author           
Canright, Geoffrey, Author
Hales, David, Author
Schindelhauer, Christian, Author
Triantafillou, Peter1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: The peer-to-peer computing paradigm is an intriguing alternative to Google-style search engines for querying and ranking Web content. In a network with many thousands or millions of peers the storage and access load requirements per peer are much lighter than for a centralized Google-like server farm; thus more powerful techniques from information retrieval, statistical learning, computational linguistics, and ontological reasoning can be employed on each peer's local search engine for boosting the quality of search results. In addition, peers can dynamically collaborate on advanced and particularly difficult queries. Moroever, a peer-to-peer setting is ideally suited to capture local user behavior, like query logs and click streams, and disseminate and aggregate this information in the network, at the discretion of the corresponding user, in order to incorporate richer cognitive models. This paper gives an overview of ongoing work in the EU Integrated Project DELIS that aims to develop foundations for a peer-to-peer search engine with Google-or-better scale, functionality, and quality, which will operate in a completely decentralized and self-organizing manner. The paper presents the architecture of such a system and the Minerva prototype testbed, and it discusses various core pieces of the approach: efficient execution of top-k ranking queries, strategies for query routing when a search request needs to be forwarded to other peers, maintaining a self-organizing semantic overlay network, and exploiting and coping with user and community behavior.

Details

show
hide
Language(s): eng - English
 Dates: 2006-06-142005
 Publication Status: Issued
 Pages: -
 Publishing info: Paderborn : University of Paderborn, Heinz Nixdorf Institute
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 279130
Other: Local-ID: C1256428004B93B8-C75BEBD94545683AC12571880046A272-WeikumBCHST05b
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Paris, France
Start-/End Date: 2005-11-14

Legal Case

show

Project information

show

Source 1

show
hide
Title: European Conference on Complex Systems (ECCS '05) Workshop on Peer-to-peer Data Management in the Complex Systems Perspective
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Paderborn : University of Paderborn, Heinz Nixdorf Institute
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 7 - 24 Identifier: -