Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups

Abstract

AbstractSkyline queries are multicriteria queries that are of great interest for decision applications. Skyline Groups extend the idea of skyline to groups of objects. In the recent years, several algorithms have been proposed to extract, in an efficient way, the complete set of skyline groups. Due to the novelty of the skyline group concept, these algorithms use custom enumeration strategies. The first contribution of this paper is the observation that a skyline group corresponds to the notion of ideal of a partially ordered set. From this observation, our second contribution consists in proposing a novel and efficient algorithm for the enumeration of all ideals of a given size k (i.e. all skyline groups of size k) of a poset. This algorithm, called GenIdeals, has a time delay complexity of \(O(w^2)\), where w is the width of the poset, which improves the best known time output complexity for this problem: \(O(n^3)\) where n is the number of elements in the poset. This work present new theoretical results and applications on skyline queries.KeywordsSkyline queriesIdeal enumerationTime delay complexity