Skyline with Presorting: Theory and Optimizations

There has been interest recently in skyline queries, also called Pareto queries, on relational databases. Relational query languages do not support search for “best” tuples, beyond the order by statement. The proposed skyline operator allows one to query for best tuples with respect to any number of attributes as preferences. In this work, we explore what the skyline means, and why skyline queries are useful, particularly for expressing preference. We describe the theoretical aspects and possible optimizations of an efficiant algorithm for computing skyline queries presented in [6].

[1]  Werner Kießling,et al.  Foundations of Preferences in Database Systems , 2002, VLDB.

[2]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[3]  H. T. Kung,et al.  On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.

[4]  Rakesh Agrawal,et al.  A framework for expressing and combining preferences , 2000, SIGMOD '00.

[5]  Beng Chin Ooi,et al.  Efficient Progressive Skyline Computation , 2001, VLDB.

[6]  Jan Chomicki,et al.  Querying with Intrinsic Preferences , 2002, EDBT.

[7]  Vagelis Hristidis,et al.  PREFER: a system for the efficient execution of multi-parametric ranked queries , 2001, SIGMOD '01.

[8]  Jan Chomicki,et al.  Skyline with presorting , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

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