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.
On acyclic conjunctive queries and constant delay enumeration
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DB 2representative citing papers
Presents constant-time CRCW PRAM algorithms for acyclic queries, semijoin algebra queries, and worst-case optimal joins that achieve work O(T^{1+ε}) for any ε>0 relative to optimal sequential time T.
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.
-
Work-Efficient Query Evaluation in Constant Time with PRAMs
Presents constant-time CRCW PRAM algorithms for acyclic queries, semijoin algebra queries, and worst-case optimal joins that achieve work O(T^{1+ε}) for any ε>0 relative to optimal sequential time T.