DocumentCode
3123860
Title
Finding Equivalent Rewritings with Exact Views
Author
Compton, Michael
Author_Institution
ICT Centre, CSIRO, Canberra, ACT
fYear
2009
fDate
March 29 2009-April 2 2009
Firstpage
1243
Lastpage
1246
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.
Keywords
database management systems; rewriting systems; conjunctive queries; database; equivalent rewritings; set semantics; Australia; Authorization; Data engineering; Data security; Databases; Error correction; Query processing; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 2009. ICDE '09. IEEE 25th International Conference on
Conference_Location
Shanghai
ISSN
1084-4627
Print_ISBN
978-1-4244-3422-0
Electronic_ISBN
1084-4627
Type
conf
DOI
10.1109/ICDE.2009.211
Filename
4812511
Link To Document