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`

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:66024a766e53 · see in the full table