Proceedings of the 17th International Conference on Data Engineering
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Finding k-dominant skylines in high dimensional space
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
On Skylining with Flexible Dominance Relation
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Telescope: zooming to interesting skylines
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Data & Knowledge Engineering
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Skyline queries were introduced to formulate multi-criteria searches. Such a query tries to select in a relation the tuples that optimize all the criteria, called dominant tuples. There rarely exists a single dominant tuple, but usually a set of incomparable ones, the skyline set. Unfortunately, the deterioration of the query (the size of its answer) increases proportionally with the number of criteria. To address this limitation, we propose a flexible approach to categorize and refine the skyline set by applying successive relaxations of the dominance conditions with respect to user's preferences. Our approach, called θ-skyline, is based on decision theory which deals with decision-making in the presence of conflicting choices. We also define global ranking method over the skyline set.