Expressiveness of structured document query languages based on attribute grammars
From MaRDI portal
Recommendations
Cited in
(14)- Query automata over finite trees
- Attribute grammars for unranked trees as a query language for structured documents
- Compact representation for answer sets of n-ary regular queries
- Tight lower bounds for query processing on streaming and external memory data
- Deciding twig-definability of node selecting tree automata
- Document spanners: a formal approach to information extraction
- Expressivity and complexity of MongoDB queries
- Compact Representation for Answer Sets of n-ary Regular Queries
- scientific article; zbMATH DE number 2080403 (Why is no real title available?)
- Logic, languages, and rules for web data extraction and reasoning over data
- On the complexity of regular-grammars with integer attributes
- Specification of a query language by the attribute method
- Automata for XML -- a survey
- Reasoning about XML with temporal logics and automata
This page was built for publication: Expressiveness of structured document query languages based on attribute grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196635)