Preference Decomposition and the Expressiveness of Preference Query Languages

DOI10.1007/978-3-319-19797-5_4zbMath1432.68116OpenAlexW824991962MaRDI QIDQ2941167

Patrick Roocks

Publication date: 27 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19797-5_4

zbMATH Keywords

preferencesrelational algebraexpressivenessquery languages

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Preference Decomposition and the Expressiveness of Preference Query Languages

Uses Software

• rPref

Cites Work

• The equational theory of pomsets
• An algebra of database preferences
• An Algebraic Calculus of Database Preferences
• An Algebra of Layered Complex Preferences
• Preference Decomposition and the Expressiveness of Preference Query Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Preference Decomposition and the Expressiveness of Preference Query Languages