Reasoning about integrity constraints for tree-structured data

DOI10.1007/s00224-017-9771-zzbMath1392.68166OpenAlexW2612038905WikidataQ114692878 ScholiaQ114692878MaRDI QIDQ1650919

Filip Murlak, Wojciech Czerwiński, Paweł Parys, Claire David

Publication date: 16 July 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5789/

zbMATH Keywords

consistencyentailmentintegrity constraintsdata treescontainmentschema mappingsunions of conjunctive queries

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Cites Work

• Unnamed Item
• Data exchange: semantics and query answering
• Linear time solvable optimization problems on graphs of bounded clique-width
• Upper bounds to the clique width of graphs
• Alternating register automata on finite words and trees
• Alternating automata on data trees and XPath satisfiability
• Containment of Monadic Datalog Programs via Bounded Clique-Width
• Two-variable logic on data trees and XML reasoning
• XML data exchange
• XPath satisfiability in the presence of DTDs
• On the Complexity of Verifying Consistency of XML Specifications
• Solving the Implication Problem for XML Functional Dependencies with Properties
• All–Instances Termination of Chase is Undecidable
• On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
• Containment and equivalence for a fragment of XPath

This page was built for publication: Reasoning about integrity constraints for tree-structured data