Many decision support applications are characterized by several features: (1) the query is typically based on multiple criteria; (2) there is no single optimal answer (or answer set); (3) because of (2), users typically look for satisfying answers; (4) for the same query, different users, dictated by their personal preferences, may find different answers meeting their needs. As such, it is important for the DBMS to present all interesting answers that may fulfill a user's need. In this article, we focus on the set of interesting answers called the skyline. Given a set of points, the skyline comprises the points that are not dominated by other points. A point dominates another point if it is as good or better in all dimensions and better in at least one dimension. We address the novel and important problem of evaluating skyline queries involving partially-ordered attribute domains.
[1]
Forouzan Golshani,et al.
Proceedings of the Eighth International Conference on Data Engineering
,
1992
.
[2]
Bernhard Seeger,et al.
An optimal and progressive algorithm for skyline queries
,
2003,
SIGMOD '03.
[3]
Beng Chin Ooi,et al.
Efficient Progressive Skyline Computation
,
2001,
VLDB.
[4]
Donald Kossmann,et al.
Shooting Stars in the Sky: An Online Algorithm for Skyline Queries
,
2002,
VLDB.
[5]
Donald Kossmann,et al.
The Skyline operator
,
2001,
Proceedings 17th International Conference on Data Engineering.