Expressiveness of structured document query languages based on attribute grammars
From MaRDI portal
Publication:3196635
DOI10.1145/505241.505245zbMath1323.68253OpenAlexW1991958955MaRDI QIDQ3196635
Frank Neven, Jan Van den Bussche
Publication date: 30 October 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/623
Database theory (68P15) Formal languages and automata (68Q45) Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (11)
Deciding twig-definability of node selecting tree automata ⋮ Tight lower bounds for query processing on streaming and external memory data ⋮ Automata for XML -- a survey ⋮ On the complexity of regular-grammars with integer attributes ⋮ Compact representation for answer sets of \(n\)-ary regular queries ⋮ Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data ⋮ Reasoning about XML with temporal logics and automata ⋮ Attribute grammars for unranked trees as a query language for structured documents ⋮ Document Spanners ⋮ Compact Representation for Answer Sets of n-ary Regular Queries ⋮ Query automata over finite trees
This page was built for publication: Expressiveness of structured document query languages based on attribute grammars
