Tractable conjunctive queries over static and dynamic relations

DOI10.4230/LIPICS.ICDT.2025.12MaRDI QIDQ7292778zbMATH OpenFDO

Authors Ahmet Kara, Zheng Luo, Miloš Nikolić, Dan Olteanu, Haozhe Zhang

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.12

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• Answering FO+MOD queries under updates on bounded degree databases
• Answering UCQs under updates and in the presence of integrity constraints
• Approximating fractional hypertree width
• Conjunctive queries with free access patterns under updates
• Counting Triangles under Updates in Worst-Case Optimal Time
• First-order queries on structures of bounded degree are computable with constant delay
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Intersection joins under updates
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Probabilistic databases
• Reachability is in DynFO
• Size bounds and query plans for relational joins
• Size bounds for factorised representations of query results
• Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
• Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
• Worst-case optimal join algorithms

This page was built for publication: Tractable conjunctive queries over static and dynamic relations

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