On the Desirability of Acyclic Database Schemes

Beeri, C., Fagin, R., Maier, D., & Yannakakis, M. (1983). On the Desirability of Acyclic Database Schemes. Journal of the ACM, 30(3), 479-513.

Type

Journal article

Intellectual base

Primary research

Year

1983

DOI

10.1145/2402.322389

Link

https://doi.org/10.1145/2402.322389

Cited by

1 citation across 1 artifact.

Domain-specific

• Yannakakis Algorithm for Acyclic Joins
  • This running-intersection condition is the certificate that allows local compatibility propagated along tree edges to become global compatibility across the whole query.

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