Database querying under changing preferences

DOI10.1007/S10472-007-9072-3MaRDI QIDQ2385451zbMATH OpenOpenAlexFDO

Authors Jan Chomicki

Publication date 12 October 2007

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0607013

zbMATH Keywords

Query evaluationInterval orderWeak orderPreference queriesPreference revisionStrict partial order

Mathematics Subject Classification ID

Database theory (68P15)

Abstract: We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is on query modification: a query transformation approach which works by revising the preference relation in the query. We provide a detailed analysis of the cases where the order-theoretic properties of the preference relation are preserved by the revision. We consider a number of different revision operators: union, prioritized and Pareto composition. We also formulate algebraic laws that enable incremental evaluation of preference queries. Finally, we consider two variations of the basic framework: finite restrictions of preference relations and weak-order extensions of strict partial order preference relations.

Recommendations

• Foundations of Information and Knowledge Systems
• On database queries involving competitive conditional preferences
• An algebra of database preferences
• A model based on outranking for database preference queries
• Combining totalitarian and Ceteris Paribus semantics in database preference queries

Cites work

• scientific article; zbMATH DE number 2086265 (Why is no real title available?)
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 1395614 (Why is no real title available?)
• scientific article; zbMATH DE number 3339023 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• Changes in preference
• Constraint Databases
• Fixed-point extensions of first-order logic
• Foundations of Information and Knowledge Systems
• Interval graphs and interval orders
• Knowledgebase transformations
• On the revision of preferences and rational inference processes
• Preference queries in deductive databases

Cited in

(10)

• Towards an efficient processing of outranking-based preference queries
• Database preference queries -- a possibilistic logic approach with symbolic priorities
• Preference update for e-commerce applications: Model, language, and processing
• A model based on outranking for database preference queries
• Consistent union and prioritized consistent union: new operations for preference aggregation
• Foundations of Information and Knowledge Systems
• Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities
• Foundations of Information and Knowledge Systems
• Contracting preference relations for database applications
• Belief base contraction by belief accrual

Describes a project that uses

Uses Software

• CP-nets

This page was built for publication: Database querying under changing preferences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385451)