The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Using Semi-Joins to Solve Relational Queries
Open accessAbstract
The semi-join is a relational algebraic operation that selects a set of tuples in one relation that match one or more tuples of another relation on the joining domains.Semi-joins have been used as a basic ingredient in query processing strategies for a number of hardware and software database systems.However, not all queries can be solved entirely using semi-joins.In this paper the exact class of relational queries that can be solved using semi-joins is shown.It is also shown that queries outside of this class may not even be partially solvable using "short" semi-join programs.In addition, a linear-time membership test for this class is presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
A relational model of data for large shared data banks
Codd, E. F. (1970) · Communications of the ACM · doi:10.1145/362384.362685 · Cited by 5,547
Optimal implementation of conjunctive queries in relational data bases
Chandra, A. K., & Merlin, P. M. (1977) · Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 · doi:10.1145/800105.803397 · Cited by 1,224
SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
Chamberlin, D. D., Astrahan, M. M., Eswaran, K. P., Griffiths, P. P., Lorie, R. A., Mehl, J. W., Reisner, P., & Wade, B. W. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.206.0560 · Cited by 523
Decomposition—a strategy for query processing
Wong, E., & Youssefi, K. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320479 · Cited by 387
Equivalences among Relational Expressions
Aho, A. V., Sagiv, Y., & Ullman, J. D. (1979) · SIAM Journal on Computing · doi:10.1137/0208017 · Cited by 365
Optimizing the performance of a relational algebra database interface
Smith, J. M., & Chang, P. Y.-T. (1975) · Communications of the ACM · doi:10.1145/361020.361025 · Cited by 212
A survey of research and development in distributed database management
Rothnie, J. B., & Goodman, N. (1977) · Very Large Data Bases · Cited by 103
Performance evaluation of a relational associative processor
Ozkarahan, E. A., Schuster, S. A., & Sevcik, K. C. (1977) · ACM Transactions on Database Systems · doi:10.1145/320544.320553 · Cited by 94
Cited by
On the Desirability of Acyclic Database Schemes
Beeri, C., Fagin, R., Maier, D., & Yannakakis, M. (1983) · Journal of the ACM · doi:10.1145/2402.322389 · Cited by 808
Query processing in a system for distributed databases (SDD-1)
Bernstein, P. A., Goodman, N., Wong, E., Reeve, C. L., & Rothnie, J. B. (1981) · ACM Transactions on Database Systems · doi:10.1145/319628.319650 · Cited by 493
Self-citationIdentifying the Minimal Transversals of a Hypergraph and Related Problems
Eiter, T., & Gottlob, G. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539793250299 · Cited by 437
Column-stores vs. row-stores: how different are they really?
Abadi, D. J., Madden, S. R., & Hachem, N. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376712 · Cited by 436
Join processing in relational databases
Mishra, P., & Eich, M. H. (1992) · ACM Computing Surveys · doi:10.1145/128762.128764 · Cited by 409
Metadata
- Authors
- Bernstein, P. A., & Chiu, D.-M. W.
- Venue
- Journal of the ACM
- Published
- 1981-01
- Volume
- 28
- Issue
- 1
- Pages
- 25-40
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2153485419
- Cited by
- 464
- References
- 9
- FWCI
- 33.99
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Using Semi-Joins to Solve Relational Queries. https://app.cochat.ai/papers/10.1145/322234.322238
- The paper
- Bernstein, P. A., & Chiu, D.-M. W. (1981). Using Semi-Joins to Solve Relational Queries. Journal of the ACM. https://doi.org/10.1145/322234.322238
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.