TY  - JOUR
A1  - Möller, Bernhard
A1  - Roocks, Patrick
T1  - An algebra of layered complex preferences
T2  - Lecture Notes in Computer Science
N2  - Preferences allow more flexible and personalised queries in database systems. Evaluation of such a query means to select the maximal elements from the respective database w.r.t. to the preference, which is a partial strict-order. Often one requires the additional property of negative transitivity; such a strict weak order induces equivalence classes of "equally good" tuples, arranged in layers of the order. We extend our recent algebraic, point-free, calculus of database preferences to cope with weak orders. Since the approach is completely first-order, off-the-shelf automated provers can be used to show theorems concerning the evaluation algorithms for preference-based queries and their optimisation. We use the calculus to transform arbitrary preferences into layered ones and present a new kind of Pareto preference as an application.
Y1  - 2012
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/58758
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-587588
SN  - 9783642333132
SN  - 9783642333149
SN  - 0302-9743
SN  - 1611-3349
VL  - 7560
SP  - 294
EP  - 309
PB  - Springer
CY  - Berlin
ER  -