Abstract
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.
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
Börzsönyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: Data Engineering (ICDE 2001), pp. 421–430 (2001)
Chomicki, J.: Preference Formulas in Relational Queries. ACM Transactions on Database Systems 28(4), 427–466 (2003)
Desharnais, J., Möller, B., Struth, G.: Kleene Algebra With Domain. ACM Transactions on Computational Logic 7, 798–833 (2006)
Fishburn, P.C.: Utility Theory for Decision Making. Wiley, New York (1970)
Kießling, W., Endres, M., Wenzel, F.: The Preference SQL System – An Overview. IEEE Data Eng. Bull. 34(2), 11–18 (2011)
Kießling, W.: Preference Queries with SV-Semantics. In: International Conference on Management of Data (COMAD 2005), pp. 15–26 (2005)
Maddux, R.: Relation Algebras. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science. Advances in Comp. Sci. Springer (1997)
Marimont, R.: A New Method of Checking the Consistency of Precedence Matrices. Journal of the ACM 6(2), 164–171 (1959)
Möller, B., Roocks, P.: Proof of the Distributive Law for Prioritisation and Pareto Composition, http://tinyurl.com/c79wdrt
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., Endres, M., Mandl, S., Kießling, W.: Composition and Efficient Evaluation of Context-Aware Preference Queries. In: Lee, S.-G., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012, Part II. LNCS, vol. 7239, pp. 81–95. Springer, Heidelberg (2012)
Schmidt, G., Ströhlein, S.: Relations and Graphs — Discrete Mathematics for Computer Scientists. Springer (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Möller, B., Roocks, P. (2012). An Algebra of Layered Complex Preferences. In: Kahl, W., Griffin, T.G. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2012. Lecture Notes in Computer Science, vol 7560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33314-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-33314-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33313-2
Online ISBN: 978-3-642-33314-9
eBook Packages: Computer ScienceComputer Science (R0)