An algebra of database preferences
- 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.
Author: | Bernhard MöllerGND, Patrick Roocks |
---|---|
URN: | urn:nbn:de:bvb:384-opus4-397367 |
Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/39736 |
ISSN: | 2352-2208OPAC |
Parent Title (English): | Journal of Logical and Algebraic Methods in Programming |
Publisher: | Elsevier BV |
Type: | Article |
Language: | English |
Year of first Publication: | 2015 |
Publishing Institution: | Universität Augsburg |
Release Date: | 2018/08/07 |
Volume: | 84 |
Issue: | 3 |
First Page: | 456 |
Last Page: | 481 |
DOI: | https://doi.org/10.1016/j.jlamp.2015.01.001 |
Institutes: | Fakultät für Angewandte Informatik |
Fakultät für Angewandte Informatik / Institut für Informatik | |
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme | |
Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
Licence (German): | CC-BY-NC-ND 4.0: Creative Commons: Namensnennung - Nicht kommerziell - Keine Bearbeitung (mit Print on Demand) |