Maximum Coverage Representative Skyline

Skyline queries represent a dataset by the points on its pareto frontier, but can become very large. To alleviate this problem, representative skylines select exactly k skyline points. However, existing approaches are not scaleinvariant, not stable, or must materialise the entire skyline. We introduce the maximum coverage representative skyline, which returns the k points collectively dominating the largest area of the data space. It satisfies the above properties and reflects a critical property of the skyline itself.

[1]  Jian Pei,et al.  Distance-Based Representative Skyline , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[2]  Ira Assent,et al.  Work-Efficient Parallel Skyline Computation for the GPU , 2015, Proc. VLDB Endow..

[3]  Anthony K. H. Tung,et al.  On High Dimensional Skylines , 2006, EDBT.

[4]  George Valkanas,et al.  Skyline Ranking à la IR , 2014, EDBT/ICDT Workshops.

[5]  Michalis Vazirgiannis,et al.  Link-based Ranking of Skyline Result Sets , 2007 .

[6]  Xuemin Lin,et al.  Selecting Stars: The k Most Representative Skyline Operator , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[7]  Richard J. Lipton,et al.  Regret-minimizing representative databases , 2010, Proc. VLDB Endow..

[8]  Alex Thomo,et al.  Computing k-Regret Minimizing Sets , 2014, Proc. VLDB Endow..

[9]  Donald Kossmann,et al.  The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.

[10]  Ira Assent,et al.  Taking the Big Picture: representative skylines based on significance and diversity , 2014, The VLDB Journal.