Database querying under changing preferences |
| |
Authors: | Jan Chomicki |
| |
Affiliation: | (1) Dept. of Computer Science and Engineering, University at Buffalo, Buffalo, NY 14260-2000, USA |
| |
Abstract: | 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 |
本文献已被 SpringerLink 等数据库收录! |
|