On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Database selection for processing k nearest neighbors queries in distributed environments
Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Protecting Free Expression Online with Freenet
IEEE Internet Computing
IEEE Internet Computing
Evaluating Top-k Selection Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
The Piazza peer data management project
ACM SIGMOD Record
Relational data sharing in peer-based data management systems
ACM SIGMOD Record
KLEE: a framework for distributed top-k query algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Distributed top-N query processing with possibly uncooperative local systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Top-k query evaluation with probabilistic guarantees
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A framework for decentralized ranking in web information retrieval
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Best position algorithms for top-k queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On efficient top-k query processing in highly distributed environments
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
POT: an efficient top-k monitoring method for spatially correlated sensor readings
Proceedings of the 5th workshop on Data management for sensor networks
Optimizing Distributed Top-k Queries
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Scalable and topology-aware reconciliation on P2P networks
Distributed and Parallel Databases
Distributed top-k aggregation queries at large
Distributed and Parallel Databases
Best position algorithms for efficient top-k query processing
Information Systems
Efficient approximate top-k query algorithm using cube index
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Efficient distributed top-k query processing with caching
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Efficient early top-k query processing in overloaded P2P systems
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Distributed top-k query processing by exploiting skyline summaries
Distributed and Parallel Databases
On saying "enough already!" in MapReduce
Proceedings of the 1st International Workshop on Cloud Intelligence
Processing top-k queries in distributed hash tables
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
As-Soon-As-Possible top-k query processing in p2p systems
Transactions on Large-Scale Data- and Knowledge-centered systems IX
Hi-index | 0.00 |
A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solution to this problem is to use Top-k queries whereby the user can specify a limited number (k) of the most relevant answers. In this paper, we present FD, a (Fully Distributed) framework for executing Top-k queries in unstructured P2P systems, with the objective of reducing network traffic. FD consists of a family of algorithms that are simple but effective. FD is completely distributed, does not depend on the existence of certain peers, and addresses the volatility of peers during query execution. We validated FD through implementation over a 64-node cluster and simulation using the BRITE topology generator and SimJava. Our performance evaluation shows that FD can achieve major performance gains in terms of communication and response time.