On Acyclic Conjunctive Queries and Constant Delay Enumeration

DOI10.1007/978-3-540-74915-8_18zbMath1179.68047OpenAlexW1579803282MaRDI QIDQ3608414

Etienne Grandjean, Arnaud Durand, Guillaume Bagan

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in computer science (03B70)

Related Items (24)

Structural tractability of counting of solutions to conjunctive queries ⋮ Enumeration for FO Queries over Nowhere Dense Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Enumerating teams in first-order team logics ⋮ Covers of Query Results ⋮ The complexity of weighted counting for acyclic conjunctive queries ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ Fine-Grained Complexity of Regular Path Queries ⋮ Linear Programs with Conjunctive Database Queries ⋮ Rewriting with Acyclic Queries: Mind Your Head ⋮ Computing thejth solution of a first-order query ⋮ Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs ⋮ Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight ⋮ A complexity theory for hard enumeration problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Formal Framework for Complex Event Processing ⋮ A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties ⋮ Enumeration complexity of conjunctive queries with functional dependencies ⋮ Structural tractability of enumerating CSP solutions

This page was built for publication: On Acyclic Conjunctive Queries and Constant Delay Enumeration