Size Bounds for Factorised Representations of Query Results

DOI10.1145/2656335zbMath1474.68117OpenAlexW2050100848MaRDI QIDQ5012518

Dan Olteanu, Jakub Závodný

Publication date: 25 November 2021

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2656335

zbMATH Keywords

query evaluationconjunctive queriessuccinct representationhypertree decompositionssize boundsdata factorisation

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (10)

Unnamed Item ⋮ Covers of Query Results ⋮ HyperBench ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ Linear Programs with Conjunctive Database Queries ⋮ Rewriting with Acyclic Queries: Mind Your Head ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parameterized counting of partially injective homomorphisms

This page was built for publication: Size Bounds for Factorised Representations of Query Results