Semantic Optimization Techniques for Preference Queries

Details Semantic Optimization Techniques for Preference Queries Semantic Optimization Techniques for Preference Queries

2005-10-14

arxiv.org/abs/cs/0510036v1

Computer Science

Databases

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Semantic Optimization Techniques for Preference Queries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Semantic Optimization Techniques for Preference Queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semantic Optimization Techniques for Preference Queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-222535