2006 Proceeding- Program Chairs:
- Ivana Podnar,
- Fabrizio Silvestri,
- Jie Lu,
- Raffaele Perego
It is our great pleasure to welcome you to the Workshop on Information Retrieval in Peer-to-Peer Networks -- P2PIR 2006. This year's workshop is a team effort which continues the tradition of past workshops, the Workshop on Information Retrieval in Peer-to-Peer Networks which was collocated with SIGIR in 2004 and with CIKM in 2005, and the Workshop on Heterogeneous Distributed Information Retrieval collocated with SIGIR in 2005. The mission of the workshop is to excite and promote research in the area of information retrieval in distributed and decentralized environments in order to design solutions for next-generation search engines that will have to deal with huge amounts of heterogeneous and continuously changing data.The call for papers attracted 13 submissions from Asia, Europe, and the United States. The program committee accepted 7 scientific papers that cover a variety of topics related to distributed and peer-to-peer information retrieval. The papers present original and novel solutions for resource selection and query routing, indexing techniques in decentralized environments, and architectures and implementations of truly-distributed retrieval engines.
Proceeding Downloads
Emerging semantic communities in peer web search
Peer network systems are becoming an increasingly important development in Web search technology. Many studies show that peer search systems perform better when a query is sent to a group of peers semantically similar to the query. This suggests that ...
Efficient peer-to-peer semantic overlay networks based on statistical language models
In this paper we address the query routing problem in peer-to-peer (P2P) information retrieval. Our system builds up on the idea of a Semantic Overlay Network (SON), in which each peer becomes neighbor of a small number of peers, chosen among those that ...
M-Grid: similarity searching in grid
The problem of similarity searching is nowadays attracting a lot of attention, because upcoming applications process complex data and the traditional exact match searching is not sufficient. There are efficient solutions, but they are tailored for the ...
Size doesn't always matter: exploiting pageRank for query routing in distributed IR
PageRank authority scores have proven to be a powerful ingredient to local document scoring. Since query routing, i.e., carefully selecting a small subset of promising peers for a particular query from a large network, bears a close resemblance to local ...
Distributed cache table: efficient query-driven processing of multi-term queries in P2P networks
The state-of-the-art techniques for processing multi-term queries in P2P environments are query flooding and inverted list intersection. However, it has been shown that due to scalability reasons both methods fail to support full-text search in large ...
ALVIS peers: a scalable full-text peer-to-peer retrieval engine
We present Alvis peers, a full-text P2P retrieval engine designed to offer retrieval performance comparable to centralized solutions while scaling to a very large number of peers. It is the result of our research efforts within the project Alvis1 ...
Novel applications of information retrieval techniques to peer-to-peer file-sharing systems
A leading application of peer-to-peer technology is file sharing. Because of its scale -- in the millions of users daily -- it is important that file-sharing systems have good search capabilities. A salient characteristic of these systems is that shared ...
