Using Semi-Joins to Solve Relational Queries

Bernstein, P. A., & Chiu, D. W. (1981). Using Semi-Joins to Solve Relational Queries. Journal of the ACM, 28(1), 25-40.

Type

Journal article

Intellectual base

Primary research

Year

1981

Volume

28

Issue

1

Pages

25-40

DOI

10.1145/322234.322238

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/322234.322238

Cited by

1 citation across 1 artifact.

Domain-specific

• Yannakakis Algorithm for Acyclic Joins
  • Bernstein and Chiu studied semijoin-solvable queries; Bernstein and Goodman characterized natural-semijoin full reducers and the two-pass reducer for tree queries.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:eb58d767f808 · see in the full table