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.
Ngo, and Atri Rudra
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 2
citation-polarity summary
fields
cs.DB 2years
2026 2roles
method 1polarities
use method 1representative citing papers
The paper develops a general incremental maintenance technique for arbitrary join queries that achieves update times bounded by an optimizable maintenance width using heavy-light partitioning.
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.
-
Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations
The paper develops a general incremental maintenance technique for arbitrary join queries that achieves update times bounded by an optimizable maintenance width using heavy-light partitioning.