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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Dynamic XML documents with distribution and replication
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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
Querying the internet with PIER
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
A simulation framework for schema-based query routing in p2p-networks
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Scalable and topology-aware reconciliation on P2P networks
Distributed and Parallel Databases
Processing fuzzy queries in a peer data management system using distributed fuzzy summaries
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
| Hi-index | 0.00 |
Top-k queries are attractive for users in P2P systems with very large numbers of peers but difficult to support efficiently. In this paper, we propose a fully distributed algorithm for executing Top-k queries in the context of the APPA (Atlas Peer-to-Peer Architecture) data management system. APPA has a network-independent architecture that can be implemented over various P2P networks. Our algorithm requires no global information, does not depend on the existence of certain peers and its bandwidth cost is low. We validated our algorithm through implementation over a 64-node cluster and simulation using the BRITE topology generator and SimJava. Our performance evaluation shows that our algorithm has logarithmic scale up and improves Top-k query response time very well using P2P parallelism in comparison with baseline algorithms.