The complexity of reasoning about pattern-based XML schemas

Gjergji Kasneci, Thomas Schwentick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form (r,s), wherer, s are regular expressions. Sets of such rules can be interpreted in an existential or a universal fashion. An XML tree is existentially valid with respect to a rule set, if for each node there is a rule such that the root path of the node matches r and the children sequence of the node matchess. It is universally valid if each node matching r also matchess. This paper investigates the complexity of reasoning about such rule sets, in particular the satisfiability and the implication problem. Whereas, in general these reasoning problems are complete for EXPTIME, two important fragments are identified with PSPACE and PTIME complexity, respectively.

Original languageEnglish
Title of host publicationProceedings of the Twenty-sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2007
Pages155-164
Number of pages10
DOIs
StatePublished - 2007
Externally publishedYes
Event26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2007 - Beijing, China
Duration: 11 Jun 200713 Jun 2007

Publication series

NameProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Conference

Conference26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2007
Country/TerritoryChina
CityBeijing
Period11/06/0713/06/07

Keywords

  • Integrity constraints
  • XML schemas

Fingerprint

Dive into the research topics of 'The complexity of reasoning about pattern-based XML schemas'. Together they form a unique fingerprint.

Cite this