An algebra of layered complex 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. 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.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Bernhard MöllerGND, Patrick Roocks
URN:urn:nbn:de:bvb:384-opus4-587588
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/58758
ISBN:9783642333132OPAC
ISBN:9783642333149OPAC
ISSN:0302-9743OPAC
ISSN:1611-3349OPAC
Parent Title (English):Lecture Notes in Computer Science
Publisher:Springer
Place of publication:Berlin
Type:Article
Language:English
Year of first Publication:2012
Publishing Institution:Universität Augsburg
Release Date:2019/07/23
Volume:7560
First Page:294
Last Page:309
DOI:https://doi.org/10.1007/978-3-642-33314-9_20
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):Deutsches Urheberrecht

OPUS4 Logo