Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. Journal of the ACM, 27(4):633--655, 1980. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Query Containment for Conjunctive Queries with Safe Negation - Wei, Lausen (Correct)
....(CQ) with safe negated subgoals CQ . The query containment problem is to check whether the answer set of one query is always a subset of another query for any given database. Algorithms for query containment are of interest in several contexts in the database area. For query optimization [CM77, SY80] the task is to find redundant subgoals. Algorithms for data integration on the web rely on query rewriting using views, for which deciding query containment is a crucial sub step [LMSS95] Furthermore, query containment has also been used for checking integrity constraints [GSUW94] and for ....
....of updates [LS93] Starting with the NP completeness result proposed by Chandra and Merlin [CM77] many researchers have been working on extensions of the containment question. Containment of CQ s with inequalities is discussed in [Klu88, Z O97] Containment of unions of CQ s is treated in [SY80] containment of CQ s with negated subgoals in [LS93, Ull97] containment over complex objects in [LS97] and over semi structured data with regular expression in [FLS98] 1 The problem of query containment for conjunctive queries with safe negated subgoals has drawn considerably less attention ....
[Article contains additional citation context not shown here]
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and difference operations. Journal of the ACM, (4), 27(4):633--655, 1980.
Materializing Views with Minimal Size To Answer Queries - Chirkova, Li (2003) (1 citation) (Correct)
....has just one query q, i.e. Q ,andV is a (not necessarily optimal) disjunctive solution for Q. Consider a rewriting of the query Q using and consider the expansion of the rewriting, which is a union of several conjunctive queries. One of these queries, P , is equivalent to the query Q [28]. We call P the equivalent conjunct of Q in terms of V. Suppose the viewset contains a nontrivial disjunctive view V .LetV be a union of conjunctive views V1, V l . Consider an alternative solution # that is obtained by replacing, this disjunctive view V by V1, V l .The # is a ....
....Xn1 ) V nmn ( Xnmn ) Here, each view V ij k belongs to the viewset V. By definition, the conjunctive query Q is equivalent to the union of the expansions of these queries P i .Eachexpansion is a union of conjunctive queries, because each view V ij k may be a disjunctive view. From [28], the query Q is equivalent to one of the expanded queries, denoted Ek,and the remaining expanded queries are contained in Q.Letthis expanded query Ek come from the query P i in P1, P n . We can keep all the views # used in P i .NoticethatP i is an equivalent conjunctive rewriting of Q ....
[Article contains additional citation context not shown here]
Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and di#erence operators. Journal of the ACM, 27(4):633--655, 1980.
A Scalable Algorithm for Query Minimization - Kunen, Suciu (2002) (1 citation) (Correct)
....distinct rows does not mean that these actually occur in the evaluation of a query. 8 Related Work The problem of query containment on which our system is based dates to the work of Chandra and Merlin [8] Subsequent work has considered containment for various extensions of conjunctive queries [21, 3], datalog [24, 22, 9] queries with order predicates [17, 28, 19, 30, 16] with complex objects [20] with regular expressions [13] and under bag semantics [10] In [7] Bodlaender shows that given a constant bound on the treewidth, there is a linear time algorithm to recognize whether a graph ....
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and di erence operators. Journal of the ACM, 27(4):633-655, 1981.
Speeding Up Inferences Using Relevance - Reasoning Formalism And Self-citation (Sagiv) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and difference operators. Journal of the ACM, 27(4):633--655, 1981.
Composition of Mappings Given by Embedded - Dependencies Alan Nash (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. Journal of the ACM, 27(4):633--655, 1980.
Rewriting Queries Using Views with Access - Patterns Under Integrity (Correct)
No context found.
Yehoshua Sagiv and Mihalis Yannakakis. Equivalences among relational expressions with the union and di#erence operators. Journal of the ACM, 27(4):633--655, 1980.
Rewriting Queries Using Views with Access - Patterns Under Integrity (Correct)
No context found.
Yehoshua Sagiv and Mihalis Yannakakis. Equivalences among relational expressions with the union and di#erence operators. Journal of the ACM, 27(4):633--655, 1980.
Modular Class Analysis with DATALOG - Besson, Jensen, Spoto (2003) (6 citations) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalences among Relational Expressions with the Union and Di#erence Operators. Journal of the ACM, 27(4):633--655, 1980. 25
Data Sharing through Query Translation in Autonomous Sources - Kementsietsidis, Arenas (2004) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalences Among Relational Expressions with the Union and Di#erence Operators. JACM, 27(4):633--655, 1980. 479
Efficient XML-to-SQL Query Translation: Where to Add .. - Krishnamurthy.. (2004) (2 citations) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and di#erence operators. Journal of the ACM (JACM), 27(4), 1980.
Containment of Nested XML Queries - Dong, Halevy, Tatarinov (2004) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and di#erence operators. Journal of the ACM, 27(4):633--655, 1980.
Towards Automated Reformulation of Specifications - Mancini (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and di#erence operations. Journal of the ACM, 4(27):633--655, 1980.
MiniCon: A Scalable Algorithm for Answering Queries Using Views - Pottinger, Halevy (2001) (1 citation) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and di erence operators. Journal of the ACM, 27(4):633{ 655, 1981.
Data Sharing Through Query Translation in Autonomous Sources - Kementsietsidis, Arenas (2004) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalences Among Relational Expressions with the Union and Di#erence Operators. JACM, 27(4):633--655, 1980.
Query Planning and Optimization in Information Integration - Duschka (1997) (38 citations) (Correct)
No context found.
Yehoshua Sagiv and Mihalis Yannakakis. Equivalence among relational expressions with the union and difference operators. J. ACM, 27(4):633--655, 1980.
Containment of Nested XML Queries - Dong, Halevy, Tatarinov (2003) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and di#erence operators. Journal of the ACM, 27(4):633--655, 1980.
Efficient XML-to-SQL Query Translation: Where to Add .. - Krishnamurthy.. (2004) (2 citations) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and di#erence operators. Journal of the ACM (JACM), 27(4), 1980.
On the Computation of Relational View Complements - Lechtenbörger, Vossen (2003) (Correct)
No context found.
Y. Sagiv, M. Yannakakis, "Equivalences Among Relational Expressions with the Union and Di#erence Operators," JACM 27, 1980, 633--655.
Answering Queries Using Views: A Survey - Halevy (2000) (103 citations) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and di erence operators. Journal of the ACM, 27(4):633-655, 1981.
Survey on Methods for Query Rewriting and Query Answering.. - Calvanese, al. (2001) (3 citations) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and di erence operators. J. of the ACM, 27(4):633-655, 1980.
Processing Unions of Conjunctive Queries with - Negation Under Limited (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalences Among Relational Expressions with the Union and Di#erence Operators. Journal of the ACM, 27(4):633-- 655, 1980.
Reasoning on Regular Path Queries - Calvanese, De Giacomo, Lenzerini.. (2003) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. J. of the ACM, 27(4):633--655, 1980.
Containment of Nested XML Queries - Xin Dong Alon (2003) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and di#erence operators. Journal of the ACM, 27(4):633--655, 1980.
Query Containment for Data Integration Systems - Todd Millstein Alon (2000) (22 citations) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and di erence operators. Journal of the ACM, 27(4):633-655, 1980.
Representing and Reasoning about Mappings between Domain.. - Jayant Madhavan Philip (2002) (22 citations) (Correct)
No context found.
Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and difference operators. Journal of the ACM, 27(4):633--655, 1981.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC