Answering FO+MOD queries under updates on bounded degree databases
From MaRDI portal
Publication:3174897
Recommendations
- Answering FO+MOD queries under updates on bounded degree databases
- Answering UCQs under updates and in the presence of integrity constraints
- First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!
- First-order queries on structures of bounded degree are computable with constant delay
- Constant delay enumeration for FO queries over databases with local bounded expansion
Cited in
(14)- Enumeration on trees under relabelings
- Intersection joins under updates
- Modulo counting on words and trees
- Enumeration complexity of conjunctive queries with functional dependencies
- Hardness self-amplification: simplified, optimized, and unified
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
- Constant delay enumeration for FO queries over databases with local bounded expansion
- General space-time tradeoffs via relational queries
- Answering FO+MOD queries under updates on bounded degree databases
- Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- Answering UCQs under updates and in the presence of integrity constraints
- Range updates and range sum queries on multidimensional points with monoid weights
- Counting Triangles under Updates in Worst-Case Optimal Time
This page was built for publication: Answering FO+MOD queries under updates on bounded degree databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174897)
