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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2023 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
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.