TOP-k query calculation in peer-to-peer networks

Authors:
Qian Zhang;Yu Sun;Xia Zhang;Xuezhi Wen;Zheng Liu
Affiliations:
National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China;National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China;National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China;National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China;National Engineering Research Center for Computer Software, Northeastern University, Shenyang, China
Venue:
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Year:
2005

Citing 12
Cited 0

Searching distributed collections with inference networks

SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Cluster-based language models for distributed retrieval

Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Real life, real users, and real needs: a study and analysis of user queries on the web

Information Processing and Management: an International Journal
Approaches to collection selection and results merging for distributed information retrieval

Proceedings of the tenth international conference on Information and knowledge management
Generalizing GlOSS to Vector-Space Databases and Broker Hierarchies

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Server Ranking for Distributed Text Retrieval Systems on the Internet

Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Query Expansion by Mining User Logs

IEEE Transactions on Knowledge and Data Engineering
Merging retrieval results in hierarchical peer-to-peer networks

Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient top-K query calculation in distributed networks

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
KLEE: a framework for distributed top-k query algorithms

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Top-k query evaluation with probabilistic guarantees

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the efficient top-k queries in pure peer-to-peer (P2P) networks. Top-k receives much attention in the search engine and gains great success. However, processing top-k query in pure P2P network is very challenging due to unique characteristics of P2P environments, for example, skewed collection statistics, and higher communication costs. Inspired by the success of ranking algorithms in Web search engine, we propose a decentralized algorithm to answer top-k queries in pure peer-to-peer networks which makes use of local rankings, rank merging, and minimizes both answer set size and network traffic among peers.