Jaguar evaluates Boolean conjunctive queries in O(N^{subw(Q) + ε}) time for any ε > 0 by operating directly in the primal space of polymatroids and adaptively bounding join costs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time
Jaguar evaluates Boolean conjunctive queries in O(N^{subw(Q) + ε}) time for any ε > 0 by operating directly in the primal space of polymatroids and adaptively bounding join costs.