Talks and Poster Presentations (with Proceedings-Entry):

G. Gottlob, C. Koch:
"Monadic Queries over Tree-Structured Data";
Talk: 17th Annual IEEE Symposium on Logic in Computer Science (LIC'S02), Copenhagen, Denmark (invited); 2002-07-22 - 2002-07-25; in: "Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LIC'S02)", G. Plotkin (ed.); IEEE Computer Society, (2002), ISBN: 0-7695-1483-9; 189 - 202.

English abstract:
Monadic query languages over tree 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).

Created from the Publication Database of the Vienna University of Technology.