Top-k queries

  • Akrivi Vlachou
  • Christos Doulkeridis
  • Kjetil Nørvåg
  • Yannis Kotidis
Chapter
Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)

Abstract

Recently there has been an increased interest in database management systems to incorporate and support more flexible query operators, such as top-k, that produce results of specified cardinality, thus avoiding huge and overwhelming result sets. Top-k queries retrieve the objects that best match the user requirements by employing user-specified scoring functions that result in an ordered set of objects containing the best k objects only [30, 75]. In this chapter, efficient processing of top-k queries in peer-to-peer systems is studied. To this end, the applicability of the skyline operator is investigated for efficiently answering top-k queries for a wide class of scoring functions, indicating user-specified preferences, in large P2P networks.

Keywords

Expense Hull Cardi 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© The Author(s) 2012

Authors and Affiliations

  • Akrivi Vlachou
    • 1
  • Christos Doulkeridis
    • 1
  • Kjetil Nørvåg
    • 1
  • Yannis Kotidis
    • 2
  1. 1.Norwegian University of Science and TechnologyTrondheimNorway
  2. 2.Athens University of Economics and BusinessAthensGreece

Personalised recommendations