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.
KeywordsExpense Hull Cardi
Unable to display preview. Download preview PDF.