Conjunctive query containment over trees using schema information
type: Item
instance of: scholarly article
title: Conjunctive query containment over trees using schema information
zbMATH Open document ID: 1386.68066
author: Henrik Björklund
author: Wim Martens
author: Thomas Schwentick
published in: Acta Informatica
publication date: 2018-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6844721
describes a project that uses: XPath
describes a project that uses: Relax NG
MaRDI profile type: Publication
full work available at URL: s00236-016-0282-1
OpenAlex ID: W2536272706
cites work: Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
cites work: Relational and XML Data Exchange
cites work: XML with incomplete information
cites work: Monadic Datalog Containment
cites work: XPath satisfiability in the presence of DTDs
cites work: Conjunctive query containment over trees
cites work: Validity of Tree Pattern Queries with Respect to Schema Information
cites work: Solutions in XML data exchange
cites work: Containment of Monadic Datalog Programs via Bounded Clique-Width
cites work: Two-variable logic on data trees and XML reasoning
cites work: One-unambiguous regular languages
cites work: Alternation
cites work: Domino-tiling games
cites work: Deciding Definability by Deterministic Regular Expressions
cites work: Minimization of Tree Patterns
cites work: Conjunctive queries over trees
cites work: Complexity of Data Tree Patterns over XML Documents
cites work: Containment and equivalence for a fragment of XPath
cites work: Query evaluation via tree-decompositions
cites work: On finding minimal length superstrings
cites work: Database Programming Languages
cites work: A variant of a recursively unsolvable problem
cites work: Conjunctive-query containment and constraint satisfaction
cites work: Generalizations of regular sets and their application to a study of context-free languages
cites work: Deciding determinism of regular languages
cites work: On the complexity of typechecking top-down XML transformations
cites work: Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?
cites work: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
cites work: The shortest common supersequence problem over binary alphabet is NP- complete
cites work: The complexity of query containment in expressive fragments of XPath 2.0
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
cites work: Q4219045
cites work: Q4414543
DOI: 10.1007/S00236-016-0282-1
description: scientific article; zbMATH DE number 6844721