Dynamic direct access of MSO query evaluation over strings

DOI10.4230/LIPICS.ICDT.2025.26MaRDI QIDQ7292794zbMATH OpenFDO

Authors Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros

Publication date 8 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2025.26

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• A very hard log-space counting class
• Answering FO+MOD queries under updates on bounded degree databases
• Computing thejth solution of a first-order query
• Constant-delay enumeration for nondeterministic document spanners
• Direct access for answers to conjunctive queries with aggregation
• Direct access for conjunctive queries with negations
• Document spanners: a formal approach to information extraction
• Dynamic membership for regular languages
• Dynamic word problems
• Elements of finite model theory.
• Enumeration on trees under relabelings
• Grammars for document spanners
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• MSO queries on trees: enumerating answers under updates
• MSO queries on trees: enumerating answers under updates using forest algebras
• Streaming enumeration on nested documents
• Weak Second‐Order Arithmetic and Finite Automata
• Weight annotation in information extraction

This page was built for publication: Dynamic direct access of MSO query evaluation over strings

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