MSO queries on trees: enumerating answers under updates

DOI10.1145/2603088.2603137MaRDI QIDQ4635652zbMATH OpenOpenAlexFDO

Authors Katja Losemann, Wim Martens

Publication date 23 April 2018

Published in Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2603088.2603137

zbMATH Keywords

tree automataXPathquery enumeration

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Database theory (68P15) Logic in computer science (03B70)

Recommendations

• MSO queries on trees: enumerating answers under updates using forest algebras
• Enumeration on trees under relabelings
• MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
• Enumeration of monadic second-order queries on trees
• Linear delay enumeration and monadic second-order logic

Cited in

(7)

• Enumeration of monadic second-order queries on trees
• Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
• MSO queries on trees: enumerating answers under updates using forest algebras
• Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
• Enumeration on trees under relabelings
• MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
• Intersection joins under updates

This page was built for publication: MSO queries on trees: enumerating answers under updates

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