Logic in Computer Science (LICS 2002)

Invited Talk: Monadic Queries over Tree-Structured Data (at LICS 2002)

Authors: Georg Gottlob Christoph Koch

Abstract

Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widespread database query problem in the context of XML. Partly a survey of recent work done by the authors and their group on logical query languages for this problem and their expressiveness, this paper provides a number of new results related to the complexity of such languages over so-called axis relations (such as "child" or "descendant") which are motivated by their presence in the XPath standard or by their utility for data extraction (wrapping).

BibTeX

  @InProceedings{GottlobKoch-MonadicQueriesoverT,
    author = 	 {Georg Gottlob and Christoph Koch},
    title = 	 {Monadic Queries over Tree-Structured Data},
    booktitle =  {Proceedings of the Seventeenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2002},
    year =	 2002,
    editor =	 {Gordon Plotkin},
    month =	 {July}, 
    location =   {Copenhagen, Denmark}, 
    note =       {Invited Talk},
    publisher =	 {IEEE Computer Society Press}
  }