Decomposition of Database Preferences on the Power Set of the Domain

P. Roocks

erschienen 2015 Relational and Algebraic Methods in Computer Science --- RAMiCS 2015. Available at SpringerLink

Abstract: Database preferences allow defining strict orders on the tuples of a data set and selecting the optimal elements w.r.t. this order. In our prior work we have shown that in common implementations of preferences a small set of preference operators and operands is sufficient to express arbitrary strict orders. We have suggested preference decomposition algorithms to prove this expressiveness. In the present paper we define the induced preference on the power set of the original data set and transfer our decomposition results to this setting. We modify the algorithms of our prior work to reduce the term length and complexity of the resulting decompositions. This optimization turns out to be very efficient especially for power set preferences.