Compact representation for answer sets of \(n\)-ary regular queries

DOI10.1016/j.tcs.2010.05.026zbMath1209.68158OpenAlexW2147299872MaRDI QIDQ1959656

Haruo Hosoya, Kazuhiro Inaba

Publication date: 7 October 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.026

zbMATH Keywords

XMLtree automatadata structure

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Data structures (68P05)

Uses Software

• XPath

Cites Work

• Linear delay enumeration and monadic second-order logic
• Regular expression pattern matching for XML
• Expressiveness of structured document query languages based on attribute grammars
• Query evaluation via tree-decompositions
• MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
• Monadic datalog and the expressive power of languages for Web information extraction
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compact representation for answer sets of \(n\)-ary regular queries