Semantic Optimization Techniques for Preference Queries
| dc.creator | Chomicki, Jan | |
| dc.date | 2005-10-14 | |
| dc.date.accessioned | 2026-07-07T06:46:15Z | |
| dc.date.available | 2026-07-07T06:46:15Z | |
| dc.description | Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator ("find the most preferred tuples in a given relation"). Such queries are parameterized by specific preference relations. Semantic optimization techniques make use of integrity constraints holding in the database. In the context of semantic optimization of preference queries, we identify two fundamental properties: containment of preference relations relative to integrity constraints and satisfaction of order axioms relative to integrity constraints. We show numerous applications of those notions to preference query evaluation and optimization. As integrity constraints, we consider constraint-generating dependencies, a class generalizing functional dependencies. We demonstrate that the problems of containment and satisfaction of order axioms can be captured as specific instances of constraint-generating dependency entailment. This makes it possible to formulate necessary and sufficient conditions for the applicability of our techniques as constraint validity problems. We characterize the computational complexity of such problems. | |
| dc.identifier | https://arxiv.org/abs/cs/0510036 | |
| dc.identifier | http://arxiv.org/abs/cs/0510036 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/103274 | |
| dc.subject | Databases | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.title | Semantic Optimization Techniques for Preference Queries | |
| dc.type | text |