de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

The Complexity of Reasoning about Pattern-based XML Schemas

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44738

Kasneci,  Gjergji
Databases and Information Systems, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Kasneci, G., & Schwentick, T. (2007). The Complexity of Reasoning about Pattern-based XML Schemas. In L. Libkin (Ed.), Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems: PODS 2007 (pp. 155-164). New York, NY, USA: ACM.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-20F7-6
Zusammenfassung
In a recent paper, Martens et al. introduced a specification mechanism for {XML} tree languages, based on rules of the form r ! s, where r, 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 matches s. It is universally valid if each node matching r also matches s. 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.