Finding Equivalent Rewritings with Exact Views

Authors:
Michael Compton
Affiliations:
-
Venue:
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Year:
2009

Citing 0
Cited 2

Generating an efficient sensor network program by partial deduction

PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Fine-grained disclosure control for app ecosystems

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a study of equivalent rewritings for conjunctive queries and views: that is, queries and views expressed in terms of database predicates, but not built-in predicates. It analyses conjunctive queries and views with an exact, set semantics, corrects some errors in prior work and shows necessary and sufficient conditions on the query and views for an equivalent rewriting to exist, including showing when a view covers part of a query. The paper presents a sound and complete algorithm for finding equivalent rewritings.