Reasoning about XML constraints based on XML-to-relational mappings
From MaRDI portal
Publication:2322698
DOI10.1007/S00224-018-9846-5zbMATH Open1430.68085OpenAlexW2791627537MaRDI QIDQ2322698FDOQ2322698
Authors: Matthias Niewerth, Thomas Schwentick
Publication date: 5 September 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-018-9846-5
Recommendations
Cites Work
- Title not available (Why is that?)
- Solving the implication problem for XML functional dependencies with properties
- Containment and equivalence for a fragment of XPath
- Relational and XML Data Exchange
- Title not available (Why is that?)
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Tree acceptors and some of their applications
- Title not available (Why is that?)
- Functional dependencies and constraints on null values in database relations
- On the Complexity of Verifying Consistency of XML Specifications
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Implication and axiomatization of functional and constant constraints
- Reasoning about XML update constraints
- Satisfiability of Constraint Specifications on XML Documents
- Solving the implication problem for XML functional dependencies with properties
- Propagating XML constraints to relations
- On XML integrity constraints in the presence of DTDs
- Validating streaming JSON documents with learned VPAs
- Testing XML constraint satisfiability
This page was built for publication: Reasoning about XML constraints based on XML-to-relational mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322698)