Validity of Tree Pattern Queries with Respect to Schema Information
From MaRDI portal
Publication:2849907
DOI10.1007/978-3-642-40313-2_17zbMath1398.68187OpenAlexW139189943MaRDI QIDQ2849907
Wim Martens, Thomas Schwentick, Henrik Björklund
Publication date: 20 September 2013
Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_17
Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (3)
Schemas for unordered XML on a DIME ⋮ Conjunctive query containment over trees using schema information ⋮ Closest substring problems for regular languages
This page was built for publication: Validity of Tree Pattern Queries with Respect to Schema Information
