Skyline-based Peer-to-Peer Top-k Query Processing

  • Authors:
  • Akrivi Vlachou;Christos Doulkeridis;Kjetil Norvag;Michalis Vazirgiannis

  • Affiliations:
  • Dept. of Informatics, Athens University of Economics and Business, Greece. avlachou@aueb.gr;Dept. of Informatics, Athens University of Economics and Business, Greece. cdoulk@aueb.gr;Dept. of Computer Science, NTNU, Trondheim, Norway. Kjetil.Norvag@idi.ntnu.no;Dept. of Informatics, Athens University of Economics and Business, Greece. mvazirg@aueb.gr

  • Venue:
  • ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Due to applications and systems such as sensor networks, data streams, and peer-to-peer (P2P) networks, data generation and storage become increasingly distributed. Therefore a challenging problem is to support best-match query processing in highly distributed environments. In this paper, we present a novel framework for top-k query processing in large-scale P2P networks, where the dataset is horizontally distributed to peers. Our proposed framework returns the exact results to the user, while minimizing the number of queried super-peers and transferred data. Through simulations we demonstrate the feasibility of our approach in terms of overall response time.