D. Maier, A.O. Mendelzon and Y. Sagiv, Testing Implications of Data Dependencies, ACM Trans. Database Syst. 4(4)(1979) 455-469. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Optimizing Fixed Schema XML to SQL Query Translation - Krishnamurthy, al. (2002) (Correct)
....This can be done if the intersection of results of Query (curr seq) and SQL (v) is empty. Here curr seq is the node sequence from curr anc to u. This condition is tested by assuming the contrary and attempting to arrive at a contradiction by chasing the functional dependencies and join conditions [7] and remembering the selection conditions. At the end, we check if any of the constraints are violated. If so, then the intersection is indeed empty and curr anc is the least ancestor of u when this happens. Otherwise, we move on to the parent of curr anc. Since the least common ancestor w of u ....
D. Maier, A. O. Mendelzon, Y. Sagiv, "Testing Implications of Data Dependencies", TODS 4(4): 455-469 (1979)
Data Exchange: Semantics and Query Answering - Fagin, Kolaitis, Miller, Popa (2002) (31 citations) (Correct)
....there is a polynomial time algorithm that, given a source instance, determines whether a solution to the data exchange problem exists and, if so, produces a particular universal solution, which we call the canonical universal solution. These results make use of the classical chase procedure [MMS79,BV84] We note that, even though the chase has been widely used in reasoning about dependencies, we have not been able to find any explicit references to the fact that the chase can produce instances that have homomorphisms to all instances satisfying the dependencies under consideration. After ....
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM Transactions on Database Systems (TODS), 4(4):455-- 469, December 1979.
Data Exchange: Semantics and Query Answering - Fagin, Kolaitis, Miller, Popa (2002) (31 citations) (Correct)
....there is a polynomial time algorithm that, given a source instance, determines whether a solution to the data exchange problem exists and, if so, produces a particular universal solution, which we call the canonical universal solution. These results make use of the classical chase procedure [MMS79,BV84] We note that, even though the chase has been widely used in reasoning about dependencies, we have not been able to find any explicit references to the fact that the chase can produce instances that have homomorphisms to all instances satisfying the dependencies under consideration. After ....
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM Transactions on Database Systems (TODS), 4(4):455-- 469, December 1979.
Data Exchange: Semantics and Query Answering - Fagin, Kolaitis, Miller, Popa (2003) (31 citations) (Correct)
....solution exists if and only if a solution exists, and (2) there is a polynomial time algorithm that determines whether a solution exists and, if so, it produces a particular universal solution, which we call the canonical universal solution. These results make use of the classical chase procedure [4,15]. We note that, even though the chase has been widely used in reasoning about dependencies, we have not been able to find any explicit references to the fact that the chase can produce instances that have homomorphisms to all instances satisfying the dependencies under consideration. After this, ....
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM TODS, 4(4):455--469, Dec. 1979.
Data Exchange: Getting to the Core - Fagin, Kolaitis, Popa (2003) (2 citations) (Correct)
....general, yet practical, conditions, a universal solution exists whenever a solution exists. Furthermore, we showed that when these conditions are satisfied, there is a polynomial time algorithm for computing a canonical universal solution; this algorithm is based on the classical chase procedure [3, 15]. Data exchange with cores Even though they are homomorphically equivalent to each other, universal solutions need not be unique. In other words, in a data exchange setting, there may be many universal solutions for a given source instance . Thus, it is natural to ask: what makes a universal ....
....are treating members of , both constants and nulls, as variables. Let be the egd 2 5 . This is because the chase sets variables equal only when it is logically forced to (the result appears in papers that characterize the implication problem for dependencies; see, for instance, [3, 15]) Since . We wish to show that be the block of be the assignment to the variables of obtained by letting if aG , and otherwise. We now show that , that is, that for each conjunct , necessarily be a conjunct of ....
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM TODS, 4(4):455--469, Dec. 1979.
Minimising Simple XPath Expressions - Wood (2001) (4 citations) (Correct)
....and only if P j SAT (S) Q. Thus we need only consider SCs when determining D equivalence and D minimality of reduced XPath expressions. The same is not true for simple XPath expressions. In order to characterise D equivalence of reduced XPath trees in terms of equivalence, we introduce the chase [8], a procedure for applying a set of SCs to an XPath tree. Let P be a reduced XPath tree, S be the set of SCs implied by a DTD D, and s 2 S be a nontrivial SC of the form a : B c, where B = fb 1 ; b n g. Let u 2 NP with children v 1 ; vn such that (u) a, v i ) b i , 1 i n, ....
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. on Database Syst., 4(4):455--469, 1979.
A Corrected 5nf Definition For Relational Database - Design Millist Vincent (Correct)
No context found.
D. Maier, A.O. Mendelzon and Y. Sagiv, Testing Implications of Data Dependencies, ACM Trans. Database Syst. 4(4)(1979) 455-469.
Redundancy Elimination and a New Normal - Form For Relational (Correct)
No context found.
D. Maier, A. O. Mendelzon and Y. Sagiv. Testing Implications of Data Dependencies. ACM Transactions on Database Systems, Volume 4, Number 4, pages 455-469, 1979.
Semantic Foundations of 4NF - Semantic Foundations Of (Correct)
No context found.
Maier, D., Mendelzon, A.O. and Sagiv, Y.: Testing Implications of Data Dependencies. ACM Transactions on Database Systems 4, 455-469 (1979)
Monadic Datalog and the Expressive Power of - Languages For Web (Correct)
No context found.
Maier, D., Mendelzon, A. O., and Sagiv, Y. 1979. "Testing Implications of Data Dependencies ". ACM Transactions on Database Systems 4, 4, 455--469.
Mapping Adaptation under Evolving Schemas - Velegrakis, Miller, Popa (2003) (1 citation) (Correct)
No context found.
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM TODS, 4(4):455--469, 1979.
Locally Consistent Transformations and Query Answering in - Data Exchange Marcelo (Correct)
No context found.
D. Maier, A. O. Mendelzon, Y. Sagiv. Testing implications of data dependencies. TODS 4 (1979), 455-469.
Data Exchange: Getting to the Core - Ronald Fagin Ibm (2003) (2 citations) (Correct)
No context found.
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM Transactions on Database Systems (TODS), 4(4):455--469, Dec. 1979.
Data Exchange: Getting to the Core - Ronald Fagin Ibm (2003) (2 citations) (Correct)
No context found.
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing Implications of Data Dependencies. ACM TODS, 4(4):455--469, Dec. 1979.
Locally Consistent Transformations and Query.. - Arenas.. (2004) (Correct)
No context found.
D. Maier, A. O. Mendelzon and Y. Sagiv. Testing implications of data dependencies. ACM Transactions on Database Systems 4(4), pages 455-469, 1979.
The Relational Database Theory of Bayesian Networks - Butz (2000) (Correct)
No context found.
D. Maier, A.O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Transactions on Database Systems, 4(4):455--469, 1979.
Locally Consistent Transformations and Query.. - Arenas.. (2004) (Correct)
No context found.
D. Maier, A. O. Mendelzon and Y. Sagiv. Testing implications of data dependencies. ACM Transactions on Database Systems 4(4), pages 455-469, 1979.
Mapping Adaptation under Evolving Schemas - Yannis Velegrakis Renee (2003) (1 citation) (Correct)
No context found.
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM TODS, 4(4):455--469, 1979.
Answering Queries Using Views: A Survey - Halevy (2000) (103 citations) (Correct)
No context found.
David Maier, Alberto Mendelzon, and Yehoshua Sagiv. Testing implications of data dependencies. ACM Transactions on Database Systems, 4(4):455-469, 1979.
An Information-Theoretic Approach to Normal Forms for.. - Arenas, Libkin (2003) (6 citations) (Correct)
No context found.
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM TODS, 4(4):455-469, 1979.
Mapping Adaptation under Evolving Schemas - Yannis Velegrakis Renee (1 citation) (Correct)
No context found.
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM TODS, 4(4):455--469, 1979.
Adapting Mappings in Frequently Changing Environments - Yannis Velegrakis Renee (2003) (Correct)
No context found.
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM TODS, 4(4):455-- 469, 1979.
The Implication Problem for Unary Functional Dependencies in XML - Vincent, Liu (2002) (Correct)
No context found.
D. Maier, A.O. Mendelzon, and Y. Sagiv. Testing implication of data dependencies. ACM Transactions on Database Systems, 4(4):455 -- 468, 1979.
An Information-Theoretic Approach to Normal Forms for.. - Arenas, Libkin (2003) (6 citations) (Correct)
No context found.
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM TODS, 4(4):455--469, 1979.
An Information-Theoretic Approach to Normal Forms for.. - Arenas, Libkin (2003) (6 citations) (Correct)
No context found.
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ### ####, 4(4):455-469, 1979.
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