XPath satisfiability in the presence of DTDs
From MaRDI portal
Publication:3546365
DOI10.1145/1346330.1346333zbMath1326.68154OpenAlexW1983524017WikidataQ57495502 ScholiaQ57495502MaRDI QIDQ3546365
Michael Benedikt, Floris Geerts, Wenfei Fan
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/956
Related Items (26)
On the data complexity of consistent query answering ⋮ Deciding twig-definability of node selecting tree automata ⋮ Complexity of Two-Variable Logic on Finite Trees ⋮ Static analysis of navigational XPath over graph databases ⋮ Some modal aspects of XPath ⋮ Future-Looking Logics on Data Words and Trees ⋮ Reasoning about integrity constraints for tree-structured data ⋮ XML Schema Mappings ⋮ Frontiers of tractability for typechecking simple XML transformations ⋮ Satisfiability of Constraint Specifications on XML Documents ⋮ Solutions in XML data exchange ⋮ Structural characterizations of the navigational expressiveness of relation algebras on a tree ⋮ On the complexity of tree pattern containment with arithmetic comparisons ⋮ Repairing XML functional dependency violations ⋮ Schemas for unordered XML on a DIME ⋮ Conjunctive query containment over trees using schema information ⋮ An automata-theoretic approach to the verification of distributed algorithms ⋮ Reasoning about XML with temporal logics and automata ⋮ Axiomatizing the logical core of XPath 2.0 ⋮ Complexity of Data Tree Patterns over XML Documents ⋮ Streamable Fragments of Forward XPath ⋮ Efficient and Expressive Tree Filters ⋮ Hilbert-Style Axiomatization for Hybrid XPath with Data ⋮ Unnamed Item ⋮ Early nested word automata for XPath query answering on XML streams ⋮ Testing XML constraint satisfiability
Uses Software
This page was built for publication: XPath satisfiability in the presence of DTDs
