Database Querying under Changing Preferences
Jan Chomicki
Abstract
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.
Create a lesson
Related papers
Detecting DBMS Bugs by Constructing Equivalent Representations of Intermediate Query Results
Xiaoxu Niu, Gong Chen, Jinfu Chen et al.
ELASTIC: Trajectory-Based Synchronization of Event and Tracking Data in Soccer
Hyunsung Kim, Hoyoung Choi, Kunhee Lee et al.
Demystifying and Improving Lazy Promotion in Cache Eviction
Qinghan Chen, Muhammad Haekal Muhyidin Al-Araby, Ziyue Qiu et al.
Diachronic Hypergraphs for Orchestrated Multi-Agent Multimodal Memory Curation
Yichao Feng, Ran Zhang, Haoran Luo et al.
RENSA: Rich Environment Metadata to Navigate Shared and Distributed Endpoints for Automated Federated SPARQL Query Generation
Victor Eiti Yamamoto, Takeda Hideaki, Yamamoto Yasunori
Engaging the scientific community in high-quality biocuration: a report on the International Society for Biocuration workshop, 'Maximizing community curation for the benefit of all'
Daniela Raciti, Susan L. M. Coort, Christian Grove et al.