Generalized covers for conjunctive queries

DOI10.4230/LIPICS.ICDT.2025.28MaRDI QIDQ7292797zbMATH OpenFDO

Authors Paraschos Koutris

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

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
• Covers of Query Results
• Enumeration complexity of logical query problems with second-order variables
• Evaluation trade-offs for acyclic conjunctive queries
• General space-time tradeoffs via relational queries
• scientific article; zbMATH DE number 1875412 (Why is no real title available?)
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Size bounds for factorised representations of query results

This page was built for publication: Generalized covers for conjunctive queries

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