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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
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.