Monadic Queries over Tree-Structured Data (2002)
Cached
Download Links
- [www.dbai.tuwien.ac.at]
- [www.cs.cornell.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 62 - 7 self |
BibTeX
@MISC{Gottlob02monadicqueries,
author = {Georg Gottlob and Christoph Koch},
title = {Monadic Queries over Tree-Structured Data},
year = {2002}
}
Years of Citing Articles
OpenURL
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).







