Output-Optimal Algorithms for Acyclic Join-Aggregate Queries

Hu, X. (2025). Output-Optimal Algorithms for Acyclic Join-Aggregate Queries.

Type

Journal article

Intellectual base

Primary research

Year

2025

Link

https://arxiv.org/abs/2406.05536

Cited by

1 citation across 1 artifact.

Domain-specific

• Yannakakis Algorithm for Acyclic Joins
  • … the free/output variables preserves acyclicity. For a general acyclic but non-free-connex projection or join-aggregate query, the classical framework may create many more full witnesses than final projected tuples; a coarse fixed-query upper bound is $O(IN+IN\cdot OUT)$, and newer work improves important regimes.

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:d5dfde3f578a · see in the full table