Database Querying under Changing Preferences
<|reference_start|>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 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.<|reference_end|>
@article{chomicki2006database,
    title={Database Querying under Changing Preferences},
    author={Jan Chomicki},
    journal={arXiv preprint arXiv:cs/0607013},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0607013},
    primaryClass={cs.DB cs.AI}
}