Abstract
In this talk, I will survey recent results on the theory -- and in particular complexity -- of a number of popular logical query languages for tree-structured data and XML, including XPath, conjunctive and first-order queries, and XQuery.
An Isaac Newton Institute ProgrammeLogic and AlgorithmsQueries on Tree-Structured Data: Logical Languages and Complexity1st March 2006 Author: Christoph Koch (Universitaet des Saarlandes) AbstractIn this talk, I will survey recent results on the theory -- and in particular complexity -- of a number of popular logical query languages for tree-structured data and XML, including XPath, conjunctive and first-order queries, and XQuery. |