Database Programming Languages

DOI10.1007/11601524zbMATH Open1159.68418OpenAlexW2496305328MaRDI QIDQ5493336FDOQ5493336

Authors: Floris Geerts, Wenfei Fan 

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11601524

Recommendations

• XPath satisfiability in the presence of DTDs
• The complexity of query containment in expressive fragments of XPath 2.0
• Decidability of downward XPath
• scientific article; zbMATH DE number 1953139
• Containment and equivalence for a fragment of XPath

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (8)

• Decidable classes of documents for XPath
• Axiomatizing the logical core of XPath 2.0
• Axiomatizations for downward XPath on data trees
• Future-Looking Logics on Data Words and Trees
• Conjunctive query containment over trees using schema information
• On core xpath with inflationary fixed points
• XPath satisfiability in the presence of DTDs
• Testing XML constraint satisfiability

Uses Software

• XPath

This page was built for publication: Database Programming Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493336)