Instance and Output Optimal Parallel Algorithms for Acyclic Joins

Hu, X., & Yi, K. (2019). Instance and Output Optimal Parallel Algorithms for Acyclic Joins. PODS 2019.

Type

Conference paper

Intellectual base

Primary research

Year

2019

DOI

10.1145/3294052.3319698

DOI registrant

Association for Computing Machinery

Link

https://home.cse.ust.hk/~yike/pods19.pdf

Cited by

1 citation across 1 artifact.

Domain-specific

• Yannakakis Algorithm for Acyclic Joins
  • For a fixed full acyclic query—one that returns all query variables—the resulting running time is proportional to input plus output size under the usual RAM/hash assumptions.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:a526d3879122 · see in the full table