Reasoning about integrity constraints for tree-structured data
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4001521 (Why is no real title available?)
- All-instances termination of chase is undecidable
- Alternating automata on data trees and XPath satisfiability
- Alternating register automata on finite words and trees
- Containment and equivalence for a fragment of XPath
- Containment of monadic Datalog programs via bounded clique-width
- Data exchange: semantics and query answering
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the Complexity of Verifying Consistency of XML Specifications
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
- Solving the implication problem for XML functional dependencies with properties
- Two-variable logic on data trees and XML reasoning
- Upper bounds to the clique width of graphs
- XML data exchange
- XPath satisfiability in the presence of DTDs
Cited in
(9)- Consistency of injective tree patterns
- Logics for Unordered Trees with Data Constraints on Siblings
- Conjunctive query containment over trees using schema information
- Optimizing Conjunctive Queries over Trees Using Schema Information
- Reasoning about integrity constraints for tree-structured data
- Static analysis and query answering for incomplete data trees with constraints
- scientific article; zbMATH DE number 1755591 (Why is no real title available?)
- scientific article; zbMATH DE number 1930116 (Why is no real title available?)
- Integrity constraints for XML
This page was built for publication: Reasoning about integrity constraints for tree-structured data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650919)
