DocumentCode
2858907
Title
On Equivalence of Queries Using Views
Author
Felea, Victor ; Balta, Marian
Author_Institution
Univ. of Iasi, Iasi
fYear
2007
fDate
26-29 Sept. 2007
Firstpage
165
Lastpage
172
Abstract
In this paper we consider views expressed as unions of conjunctive formulas, where predicates of literals are views or database relations. The negation is allowed in the body of views. We assume that the variables occurring in the head of a view also occur in this body. Moreover, in case all variables occurring in negated atoms also occur in positive ones, then that query is said to be with safe negated subgoals(the safeness property). A query has a similar form to that of a view. Queries and views are considered in conjunctive forms as a conjunction of literals, as well in disjunctive forms as union of queries in conjunctive forms, respectively. Given a view V and a database D, the materialization of V for D, denoted V(D), is defined. Also for a query Q and a database D, the answer of Q for D is defined. The expansion of a query Q using a view V denoted Expansion(Q, V) is defined. We study some conditions imposed on view V to ensure the equivalence between Q and Expansion(Q, V). In this paper we consider views and queries without the safeness property.
Keywords
query formulation; query processing; conjunctive formula; query equivalence; views; Algorithm design and analysis; Database systems; Informatics; Query processing; Scientific computing; Tin;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing, 2007. SYNASC. International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-0-7695-3078-8
Type
conf
DOI
10.1109/SYNASC.2007.42
Filename
4438095
Link To Document