The complexity of XPath query evaluation and XML typing
From MaRDI portal
Recommendations
- XML with data values: Typechecking revisited.
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
- XPath satisfiability in the presence of DTDs
- Complexity of Data Tree Patterns over XML Documents
- The complexity of query containment in expressive fragments of XPath 2.0
Cited in
(17)- Worst-case optimal algorithm for XPath evaluation over XML streams
- Applying model-checking to solve queries on semistructured data
- Deciding twig-definability of node selecting tree automata
- Complexity of Data Tree Patterns over XML Documents
- Distributed XML processing: theory and applications
- scientific article; zbMATH DE number 1953140 (Why is no real title available?)
- Database Theory - ICDT 2005
- Conjunctive query containment over trees
- XPath evaluation in linear time
- Structural properties of XPath fragments
- Distributed XML design
- Memory lower bounds for XPath evaluation over XML streams
- Ramsey quantifiers over automatic structures: complexity and applications to verification
- The complexity of tree automata and XPath on grammar-compressed trees
- Automata for XML -- a survey
- On the minimization of XML schemas and tree automata for unranked trees
- Reasoning about XML update constraints
This page was built for publication: The complexity of XPath query evaluation and XML typing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546299)
