PANDAExpress proves a new output-size bound for disjunctive datalog rules and uses dynamic arbitrary hyperplane cuts to eliminate polylog factors from PANDA's runtime while matching specialized algorithms.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DB 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
PANDAExpress: a Simpler and Faster PANDA Algorithm
PANDAExpress proves a new output-size bound for disjunctive datalog rules and uses dynamic arbitrary hyperplane cuts to eliminate polylog factors from PANDA's runtime while matching specialized algorithms.
-
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.