Size bounds for factorised representations of query results

DOI10.1145/2656335MaRDI QIDQ5012518zbMATH OpenOpenAlexFDO

Authors 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

conjunctive queriesdata factorisationhypertree decompositionsquery evaluationsize boundssuccinct representation

Mathematics Subject Classification ID

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

Recommendations

• Covers of Query Results
• Bounds and algorithms for joins via fractional edge covers
• Size bounds and query plans for relational joins
• Size and treewidth bounds for conjunctive queries
• Efficient Approximations of Conjunctive Queries

Cited in

(31)

• Parameterized counting of partially injective homomorphisms
• Size bounds and query plans for relational joins
• Enumeration on trees under relabelings
• Covers of Query Results
• scientific article; zbMATH DE number 7437710 (Why is no real title available?)
• Boolean tensor decomposition for conjunctive queries with negation
• Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
• HyperBench. A benchmark and tool for hypergraphs and empirical findings
• Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
• Linear Programs with Conjunctive Database Queries
• Rewriting with Acyclic Queries: Mind Your Head
• Modern techniques for querying graph-structured databases
• Direct access for conjunctive queries with negations
• Ranked enumeration for MSO on trees via knowledge compilation
• Direct access for conjunctive queries with negations
• Direct access for answers to conjunctive queries with aggregation
• A characterization of efficiently compilable constraint languages
• Enumeration algorithms for conjunctive queries with projection
• Conjunctive queries with free access patterns under updates
• Ranked enumeration of conjunctive query results
• Any-k algorithms for enumerating ranked answers to conjunctive queries
• Box covers and domain orderings for beyond worst-case join processing
• Ranked enumeration of conjunctive query results
• Enumeration algorithms for conjunctive queries with projection
• Direct access for answers to conjunctive queries with aggregation
• The quest for faster join algorithms (invited talk)
• Tractable conjunctive queries over static and dynamic relations
• A formal language perspective on factorized representations
• Generalized covers for conjunctive queries
• FO-query enumeration over SLP-compressed structures of bounded degree
• World-set decompositions: Expressiveness and efficient algorithms

This page was built for publication: Size bounds for factorised representations of query results

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