Pages that link to "Item:Q3546299"
From MaRDI portal
The following pages link to The complexity of XPath query evaluation and XML typing (Q3546299):
Displaying 14 items.
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- Distributed XML processing: theory and applications (Q436846) (← links)
- Conjunctive query containment over trees (Q532363) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- Distributed XML design (Q657904) (← links)
- Memory lower bounds for XPath evaluation over XML streams (Q657920) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Reasoning about XML update constraints (Q923878) (← links)
- Worst-case optimal algorithm for XPath evaluation over XML streams (Q1034104) (← links)
- Applying model-checking to solve queries on semistructured data (Q1749228) (← links)
- Database Theory - ICDT 2005 (Q5316616) (← links)
- Ramsey quantifiers over automatic structures: complexity and applications to verification (Q6649458) (← links)