TY  - RPRT
A1  - Roocks, Patrick
A1  - Möller, Bernhard
T1  - An algebra of database preferences
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. We present a point-free calculus of such preferences and exemplify its use in proving algebraic laws about preferences that can be used in query optimisation. We show that this calculus can be mechanised using off-the-shelf automated first-order theorem provers.
T3  - Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg - 2013-08 
KW  - relational algebra
KW  - complex preferences
KW  - preference algebra
Y1  - 2013
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/2382
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-23820
PB  - Institut für Informatik, Universität Augsburg
CY  - Augsburg
ER  -