The Complexity of Acyclic Conjunctive Queries

Georg Gottlob, N. L., & Scarcello, F. (2001). The Complexity of Acyclic Conjunctive Queries. Journal of the ACM, 48(3), 431-498.

Type

Journal article

Intellectual base

Primary research

Year

2001

Link

https://www.cs.toronto.edu/tss/files/papers/382780.382783.pdf

Cited by

1 citation across 1 artifact.

Domain-specific

• Yannakakis Algorithm for Acyclic Joins
  • There is no materialized tuple output term beyond the Boolean report.

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