Database querying under changing preferences

We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is 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 in 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. Keywords preference queries · preference revision · query evaluation · strict partial order · weak order · interval order

• Type: Journal
• Year: 2007
• Where: AMAI
• Authors: Jan Chomicki
• Keywords: AMAI 2007, Artificial Intelligence, Preference Queries, Preference Relations, Strict Partial Order