Preference decomposition and the expressiveness of preference query languages
From MaRDI portal
Recommendations
Cites work
- An algebra of database preferences
- An Algebra of Layered Complex Preferences
- An algebraic calculus of database preferences
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 234018 (Why is no real title available?)
- scientific article; zbMATH DE number 3339023 (Why is no real title available?)
- Preference decomposition and the expressiveness of preference query languages
- The equational theory of pomsets
Cited in
(13)- An algebra of database preferences
- An algebraic calculus of database preferences
- Preference decomposition and the expressiveness of preference query languages
- On database queries involving competitive conditional preferences
- A model based on outranking for database preference queries
- Decomposition of Database Preferences on the Power Set of the Domain
- Combining totalitarian and Ceteris Paribus semantics in database preference queries
- Anti-division Queries with Ordinal Layered Preferences
- Preference Query Analysis and Optimization
- Constraint Databases
- Preference queries in deductive databases
- Strict and tolerant antidivision queries with ordinal layered preferences
- Contracting preference relations for database applications
This page was built for publication: Preference decomposition and the expressiveness of preference query languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941167)
