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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: 17th International Conference on Data Engineering, pp. 421–430 (2001)
Brink, C., Rewitsky, I.: A paradigm for program semantics: power structures and duality. CSLI Publications, Stanford (2001)
Eilenberg, S.: Automata, languages, and machines, vol. 59. Academic press (1974)
Mandl, S., Kozachuk, O., Endres, M., Kießling, W.: Preference Analytics in EXASolution. In: 16th Conference on Database Systems for Business, Technology, and Web (2015). http://tinyurl.com/pxco8d4
Möller, B., Roocks, P.: An algebra of database preferences. Journal of Logical and Algebraic Methods in Programming 84(3), 456–481 (2015). http://www.sciencedirect.com/science/article/pii/S2352220815000188
Möller, B., Roocks, P.: An algebra of layered complex preferences. In: Kahl, W., Griffin, T.G. (eds.) RAMICS 2012. LNCS, vol. 7560, pp. 294–309. Springer, Heidelberg (2012)
Möller, B., Roocks, P., Endres, M.: An Algebraic Calculus of Database Preferences. In: Gibbons, J., Nogueira, P. (eds.) MPC 2012. LNCS, vol. 7342, pp. 241–262. Springer, Heidelberg (2012)
Roocks, P.: R Script containing the experiments from Section 4 (2015). http://www.p-roocks.de/powerset-prefs-ramics.r
Roocks, P.: The rPref Package: Preferences and Skyline Computation in R (2015). http://www.p-roocks.de/rpref
Roocks, P.: Preference decomposition and the expressiveness of preference query languages. In: Hinze, R., Voigtländer, J. (eds.) MPC 2015. LNCS, vol. 9129, pp. 71–92. Springer, Heidelberg (2015). http://dx.doi.org/10.1007/978-3-319-19797-5_4
Schmidt, G., Ströhlein, T.: Relations and Graphs: Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science (1993)
Wang, Q., Balke, W.T., Kießling, W., Huhn, A.: P-news: Deeply personalized news dissemination for mpeg-7 based digital libraries. In: Heery, R., Lyon, L. (eds.) ECDL 2004. LNCS, vol. 3232, pp. 256–268. Springer, Heidelberg (2004). http://dx.doi.org/10.1007/978-3-540-30230-8_24
Winskel, G.: On powerdomains and modality. Theor. Comput. Sci. 36, 127–137 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Roocks, P. (2015). Decomposition of Database Preferences on the Power Set of the Domain. In: Kahl, W., Winter, M., Oliveira, J. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2015. Lecture Notes in Computer Science(), vol 9348. Springer, Cham. https://doi.org/10.1007/978-3-319-24704-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-24704-5_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24703-8
Online ISBN: 978-3-319-24704-5
eBook Packages: Computer ScienceComputer Science (R0)