R
Reinhard Pichler
Researcher at Vienna University of Technology
Publications - 174
Citations - 3125
Reinhard Pichler is an academic researcher from Vienna University of Technology. The author has contributed to research in topics: Treewidth & Bounded function. The author has an hindex of 27, co-authored 165 publications receiving 2946 citations. Previous affiliations of Reinhard Pichler include Siemens & University of Edinburgh.
Papers
More filters
Proceedings Article
Efficient algorithms for processing XPath queries
TL;DR: In this article, the authors show that XPath can be processed much more efficiently, and propose main-memory algorithms for this problem with polynomial-time combined query evaluation complexity, and present two fragments of XPath for which linear-time query processing algorithms exist.
Journal ArticleDOI
Efficient algorithms for processing XPath queries
TL;DR: It is shown that XPath can be processed much more efficiently, and proposed main-memory algorithms for this problem with polynomial-time combined query evaluation complexity with profitably integrated into existing XPath processors.
Patent
Efficient processing of XPath queries
TL;DR: In this paper, the authors provide methods and systems for efficient evaluation of XPath queries, which require only polynomial time with respect to the total size of an input XPath query and an input XML document.
Proceedings ArticleDOI
The complexity of XPath query evaluation
TL;DR: It is shown that both the data complexity and the query complexity of XPath 1.0 fall into lower (highly parallelizable) complexity classes, but that the combined complexity is PTIME-hard.
Journal ArticleDOI
Bounded treewidth as a key to tractability of knowledge representation and reasoning
TL;DR: In this article, the notion of treewidth has been applied to logic-based reasoning problems such as abduction, closed world reasoning, circumscription, and disjunctive logic programming.