A. Deutsch and V. Tannen. Containment and integrity constraints for xpath fragments. In KRDB, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Tree Pattern Query Minimization - Amer-Yahia, Cho, Lakshmanan.. (Correct)
.... descendant edges ( in XPath) wildcards, and branching is decidable, and that, in particular, for XPath expressions involving only branching and wildcards, minimization can be solved in polynomial time from a known result about containment of acyclic conjunctive queries [27] Deutsch and Tannen [11,12] consider containment of various fragments of XPath expressions under various ICs, also expressible in XPath, and establish decidability, undecidability, and hardness results. Most recently, Miklau and Suciu [20] show that containment and equivalence for XPath queries involving wildcards, ....
A. Deutsch and V. Tannen. Containment and integrity constraints for XPath fragments. KRDB 2001.
Containment for XPath Fragments under DTD Constraints - Wood (2003) (8 citations) (Correct)
....Q 1 contains Q 2 ; that is, for every XML tree t, whether the output of Q 1 on t contains the output of Q 2 on t. Since XPath query containment has many applications in XML querying, integration, transformation and active rule [2] environments, it has been the subject of much study recently [1, 7, 9, 10, 15, 16]. Most of the papers cited above have studied different fragments of XPath, denoted XP in [9] depending on which XPath constructs are included in the fragment. All these fragments include node tests, composition of location steps ( and predicates ( XP adds wildcards ( ....
.... , is conp complete [10, 16] Containment is undecidable when the XPath fragment includes XP along with disjunction, variable binding and equality testing, and the constraints include so called bounded simple XPath integrity constraints (SXICs) and those (unbounded) constraints implied by DTDs [7]. The decidability of containment of this XPath fragment in the presence of DTDs was stated as an open problem in [7] In this paper, we prove that D containment is decidable (exptimecomplete, in fact) for XP . The same result is proved independently in [10] The intractability of D containment ....
[Article contains additional citation context not shown here]
A. Deutsch and V. Tannen. Containment and integrity constraints for XPath fragments. In Proc. 8th Int. Workshop on Knowledge Representation Meets Databases, 2001.
Containment and Equivalence of Tree Patterns - Miklau, Suciu (2002) (1 citation) (Correct)
....two way regular path queries on a graph model. In addition to a more general data model, these queries are more expressive than ours because they allow general regular path expressions and inverse. A PSPACE upper bound for containment is shown for this class of queries. Finally, the authors of [10] prove containment results for a host of XPath related languages. One closely related result applies to an extension of P which includes binding of variables and equality testing, for which containment is shown to be 2 hard. 10 Conclusion We have studied the complexity of containment ....
A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB 2001.
Containment and Equivalence for an XPath Fragment (Extended.. - Miklau, Suciu (2002) (1 citation) (Correct)
....two way regular path queries on a graph model. In addition to a more general data model, these queries are more expressive than ours because they allow general regular path expressions and inverse. A PSPACE upper bound for containment is shown for this class of queries. Finally, the authors of [10] prove containment results for a host of XPathrelated languages. One closely related result applies to an extension of P which includes binding of variables and equality testing, for which containment is shown to be 2 hard. 10. CONCLUSION We have studied the complexity of containment ....
A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB 2001.
Enter Once, Share Everywhere: User Profile Management .. - Sahuguet, Hull.. (Correct)
....placement (including caching) and reconciliation aspects (see Section 2.3) that are not ad dressed in any prior framework to the best of our knowledge. The notion of coverage in ;UP ster requires some algorithms to decide query containment of XPath expressions (or subset of XPath) as studied in [5]. Some recent work on keys for XML [2] can also be applied to define coverage. New operators for merg ing XML components are also relevant (like Deep Union [3] or Merge [20] Security and access control: There has been a lot of work on security and access control in general. For XML, we already ....
A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB 2001.
A Formal Analysis of the Lightweight Directory Access Protocol - Wei, Lausen (Correct)
.... which is complete (with arithmetic comparison) 21] 4 Related Work Semi structured data models like XML have been intensively studied recently [2] It is more difficult to give a relational semantics to the query language XPath, since its path expressions are not first order expressible [1]. However, there have been several works on the relational semantics of the query languages (mostly a fragment of) XPath [1] XML QL [17] and XQuery [20] The early semi structured data model SML can be transformed to Datalog with function symbols allowed [16] Compared with the semi structured ....
.... intensively studied recently [2] It is more difficult to give a relational semantics to the query language XPath, since its path expressions are not first order expressible [1] However, there have been several works on the relational semantics of the query languages (mostly a fragment of) XPath [1], XML QL [17] and XQuery [20] The early semi structured data model SML can be transformed to Datalog with function symbols allowed [16] Compared with the semi structured data model, LDAP data model deploys the elegant distinguished name (DN) to express the path expression of entries of LDAP ....
[Article contains additional citation context not shown here]
A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB, 2001.
Conjunctive Query Containment In The Presence of Disjunctive.. - Wei, Lausen (2002) (1 citation) (Correct)
....guaranteed to be an element of the union Q. However, without the constraints enforced, this containment relationship would not hold any more. Moreover, in dealing with the query language like XPath for XML, disjunction is proposed in integrity constraints expressing the schema information of XML [DT01] The next integrity constraint is taken from [DT01] stating that if a node u is the descendant of both x and y, then either x and y are the same node, or x is the descendant of y, or y is the descendant of x. line) 8x; y; u [desc(x; u) desc(y; u) x = y desc(x; y) desc(y; x) In this ....
....without the constraints enforced, this containment relationship would not hold any more. Moreover, in dealing with the query language like XPath for XML, disjunction is proposed in integrity constraints expressing the schema information of XML [DT01] The next integrity constraint is taken from [DT01] stating that if a node u is the descendant of both x and y, then either x and y are the same node, or x is the descendant of y, or y is the descendant of x. line) 8x; y; u [desc(x; u) desc(y; u) x = y desc(x; y) desc(y; x) In this paper we introduce disjunctive referential integrity ....
[Article contains additional citation context not shown here]
A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB, 2001.
An Event-Condition-Action Language for XML - Bailey, Poulovassilis, Wood (2002) (3 citations) (Correct)
....So, informally speaking, if it is possible that some initial part of e 2 can specify the same path through some document as e 1 and the remainder of e 2 matches r, then ev is not independent of a. We formalise these notions below, based on tests for containment between XPath expressions [19, 20, 30]. A prefix of a simple XPath expression e is an expression e 0 such that e = e 0 =e 00 or e = e 0 = e 00 . We call e 00 the suffix of e and e 0 . Recall from Section 2.5 that, for XQuery r, type(r) denotes the result type of r, and we can test whether or not type(r) may satisfy an ....
.... expressions (denoted p 1 p 2 ) at the top level, as permitted by XPath [32] 9 We can test whether e 1 e 2 is unsatisfiable, and hence whether e 1 and e 2 are independent, by checking whether e 1 e 2 is contained in an unsatisfiable expression, using the containment test developed in [19] (which allows unions of path expressions) Example 5 Recall the two rules from Example 1. Let us call them Rule 1 and Rule 2. For i = 1; 2, the form of each rule is on INSERT e i if c i do INSERT r i BELOW f i AFTER TRUE where ffl e 1 is document( s.xml ) stores store product, ffl r 1 is ....
[Article contains additional citation context not shown here]
A. Deutsch and V. Tannen. Containment and integrity constraints for XPath fragments. In Proc. 8th Int. Workshop on Knowledge Representation Meets Databases, 2001.
Analysis and Optimisation of Event-Condition-Action Rules.. - Bailey, Poulovassilis.. (2001) (3 citations) (Correct)
....the deletion of nodes in the result of e 1 =u also causes the deletion of all the descendents of these nodes) Then we need to test if e c i for some 1 i n. For the simple XPath expressions to which our ECA rules are constrained in this paper, it is known that containment is decidable [21, 23, 35]. Thus, it is possible to devise a test for determining whether rules are self disactivating. The decidability of containment for larger fragments of the XPath language is an open problem [21] However, even if a fragment of XPath is used for which this property is undecidable, it may still be ....
....to which our ECA rules are constrained in this paper, it is known that containment is decidable [21, 23, 35] Thus, it is possible to devise a test for determining whether rules are self disactivating. The decidability of containment for larger fragments of the XPath language is an open problem [21]. However, even if a fragment of XPath is used for which this property is undecidable, it may still be possible to develop conservative approximations, and this is an area of further research. Once the activation graph between a set of ECA rules has been constructed, acyclicity of this graph ....
[Article contains additional citation context not shown here]
A. Deutsch and V. Tannen. Containment and integrity constraints for XPath fragments. In Proc. 8th Int. Workshop on Knowledge Representation Meets Databases, 2001.
The NEXT Framework for Logical XQuery Optimization - Alin Deutsch Yannis (2004) Self-citation (Deutsch) (Correct)
No context found.
A. Deutsch and V. Tannen. Containment and integrity constraints for xpath fragments. In KRDB, 2001.
MARS: A System for Publishing XML from Mixed and Redundant.. - Deutsch, Tannen (2003) (8 citations) Self-citation (Deutsch Tannen) (Correct)
No context found.
A. Deutsch and V. Tannen. Containment and integrity constraints for xpath fragments. In KRDB, 2001.
Efficient XML-to-SQL Query Translation: Where to Add .. - Krishnamurthy.. (2004) (2 citations) (Correct)
No context found.
A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB, 2001.
On Testing Satisfiability of Tree Pattern Queries - Laks Lakshmanan Ganesh (2004) (1 citation) (Correct)
No context found.
V. Tannen and A. Deutsch. Containment and integrity constraints for xpath fragments. In 8th KRDB, 2001.
Unraveling the Duplicate-Elimination Problem in.. - Krishnamurthy.. (2004) (Correct)
No context found.
A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB, 2001.
Efficient Query Reformulation in Peer Data Management Systems - Tatarinov, Halevy (2004) (5 citations) (Correct)
No context found.
A. Deutsch and V. Tannen. Containment and integrity constraints for xpath fragments. In KRDB, 2001.
Analysis and Optimisation of Event-Condition-Action Rules.. - Bailey, Poulovassilis.. (2001) (3 citations) (Correct)
No context found.
A. Deutsch and V. Tannen. Containment and integrity constraints for XPath fragments. In Proc. 8th Int. Workshop on Knowledge Representation Meets Databases, 2001.
Efficient XML-to-SQL Query Translation: Where to Add .. - Krishnamurthy.. (2004) (2 citations) (Correct)
No context found.
A. Deutsch and V. Tannen. Containment and integrity constraints for xpath fragments. In KRDB, 2001.
RRXS: Redundancy reducing XML storage in relations - Chen, Davidson, Hara, Zheng (2003) (Correct)
No context found.
A. Deutsch and V. Tannen. Containment and Integrity Constraints for XPath Fragments. In KRDB, 2001.
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