Hypertree Decompositions and Tractable Queries

Gottlob, G., Leone, N., & Scarcello, F. (2002). Hypertree Decompositions and Tractable Queries. Journal of Computer and System Sciences, 64(3), 579-627.

Type

Journal article

Intellectual base

Primary research

Year

2002

DOI

10.1006/jcss.2001.1809

Link

https://doi.org/10.1006/jcss.2001.1809

Cited by

1 citation across 1 artifact.

Domain-specific

• Yannakakis Algorithm for Acyclic Joins
  • A Yannakakis-style phase may evaluate that derived structure, but constructing the decomposition and joining within bags are additional algorithms.

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