.png){kind=icon}
返回
Semantic optimization techniques for preference queries
.png){kind=icon}
OA
AI
DOI：10.1016/j.is.2006.05.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
preference queries
query optimization
query evaluation
integrity constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Predicting Academic Achievement Among Specially Admitted Black Female College Students预测特别录取的黑人女性大学生的学业成就
PREAI
分享收藏
查看更多内容