Compact Representation for Answer Sets of n-ary Regular Queries

DOI10.1007/978-3-642-02979-0_13MaRDI QIDQ3637346zbMATH OpenOpenAlexFDO

Authors Kazuhiro Inaba, Haruo Hosoya

Publication date 9 July 2009

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02979-0_13

Mathematics Subject Classification ID

Data structures (68P05) Formal languages and automata (68Q45)

Recommendations

• Compact representation for answer sets of n-ary regular queries
• Database Programming Languages
• An incremental unique representation for regular trees
• Succinct representations of trees
• Conjunctive queries over trees

Cites work

• Expressiveness of structured document query languages based on attribute grammars
• Generalized finite automata theory with an application to a decision problem of second-order logic
• scientific article; zbMATH DE number 2080482 (Why is no real title available?)
• scientific article; zbMATH DE number 2114412 (Why is no real title available?)
• Monadic Datalog and the expressive power of languages for web information extraction
• Query evaluation via tree-decompositions
• Regular expression pattern matching for XML

Cited in

(4)

• Compact representation for answer sets of n-ary regular queries
• An incremental unique representation for regular trees
• scientific article; zbMATH DE number 1538031 (Why is no real title available?)
• Database Programming Languages

Describes a project that uses

Uses Software

• XPath

This page was built for publication: Compact Representation for Answer Sets of n-ary Regular Queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637346)