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.
| Original language | English |
|---|---|
| Pages (from-to) | 79-109 |
| Number of pages | 31 |
| Journal | Annals of Mathematics and Artificial Intelligence |
| Volume | 50 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - Jun 2007 |
Keywords
- Interval order
- Preference queries
- Preference revision
- Query evaluation
- Strict partial order
- Weak order
Fingerprint
Dive into the research topics of 'Database querying under changing preferences'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver