Covers of Query Results
From MaRDI portal
Publication:3305362
DOI10.4230/LIPIcs.ICDT.2018.16zbMath1489.68078arXiv1709.01600OpenAlexW2963245669MaRDI QIDQ3305362
Publication date: 6 August 2020
Full work available at URL: https://arxiv.org/abs/1709.01600
query planfactorized databasefractional hypertree decompositionfunctional aggregate queryminimal edge cover
Database theory (68P15) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The core of a graph
- Size Bounds and Query Plans for Relational Joins
- Approximating fractional hypertree width
- On the Desirability of Acyclic Database Schemes
- Generalized hypertree decompositions: NP-hardness and tractable variants
- Data exchange: getting to the core
- Constraint solving via fractional edge covers
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- Size Bounds for Factorised Representations of Query Results
This page was built for publication: Covers of Query Results