Portal de Periódicos da CAPES

Beyond Skylines: Explicit Preferences

2017; Springer Science+Business Media; Linguagem: Inglês

10.1007/978-3-319-55753-3_21

1611-3349

Markus Endres, Timotheus Preisinger,

Advanced Database Systems and Queries

Skyline queries are well-known in the database community and there are many algorithms for the computation of the Pareto frontier. But users do not only think of finding the Pareto optimal objects, they often want to find the best objects concerning an explicit specified preference order. While preferences themselves often are defined as general strict partial orders, almost all algorithms are designed to evaluate Pareto preferences combining weak orders, i.e., Skylines. In this paper, we consider general strict partial orders and we present a method to evaluate such explicit preferences by embedding any strict partial order into a complete lattice. This enables preference evaluation with specialized lattice based algorithms instead of algorithms relying on tuple-to-tuple comparisons and therefore speed-ups their computation as can be seen in our experiments.