Introduces Packed Plan Forest (PPF) as a polynomially bounded structure that encodes feasible ambiguous logical plans while pruning infeasible ones in cross-model NL-to-DB query planning.
arXiv preprint arXiv:1909.01822 (2019)
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
-
Feasible Plan Generation with Ambiguity-Boundedness in Cross-Model Query Processing
Introduces Packed Plan Forest (PPF) as a polynomially bounded structure that encodes feasible ambiguous logical plans while pruning infeasible ones in cross-model NL-to-DB query planning.