Database Querying under Changing Preferences
| dc.creator | Chomicki, Jan | |
| dc.date | 2006-07-05 | |
| dc.date.accessioned | 2026-07-07T07:16:16Z | |
| dc.date.available | 2026-07-07T07:16:16Z | |
| dc.description | 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. | |
| dc.description | Submitted to a journal | |
| dc.identifier | https://arxiv.org/abs/cs/0607013 | |
| dc.identifier | http://arxiv.org/abs/cs/0607013 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/113526 | |
| dc.subject | Databases | |
| dc.subject | Artificial Intelligence | |
| dc.subject | H.2.3; F.4.1; I.2.3 | |
| dc.title | Database Querying under Changing Preferences | |
| dc.type | text |