The PANDA framework derives information-theoretically tight upper bounds on intermediate relation cardinalities to both cost and construct query plans for conjunctive queries, matching or subsuming specialized algorithms including those based on fast matrix multiplication.
Alon,On the number of subgraphs of prescribed type of graphs with a given number of edges, Israel J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Query Optimization and Evaluation via Information Theory: A Tutorial
The PANDA framework derives information-theoretically tight upper bounds on intermediate relation cardinalities to both cost and construct query plans for conjunctive queries, matching or subsuming specialized algorithms including those based on fast matrix multiplication.