The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Power of Natural Semijoins
Abstract
A semijoin is a relational operator that is used to reduce the cost of processing queries in the SDD-1 distributed database system, the RAP database machine, and similar systems. Semijoin is used in these systems as part of a query pre-processing phase; its function is to “reduce” the database by delimiting those portions of the database that contain data relevant to the query. For some queries, there exist sequences of semijoins that “fully reduce” the database; those sequences delimit the exact portions of the database needed to answer the query in the sense that if any less data were delimited then the query would produce a different answer. Such sequences are called full reducers. This paper characterizes the queries for which full reducers exist and presents an efficient algorithm for constructing full reducers where they do exist. This paper extends the results of Bernstein and Chiu [J. Assoc. Comput. Mach., 28 (1981), pp. 25–40] by considering a more powerful semijoin operator. We consider “natural” semijoins instead of the “single attribute” semijoins of Bernstein and Chiu. A novel feature of our treatment is an extensive use of the “tableau methodology” of Aho, Sagiv and Ullman [SIAM J. Comput., 8 (1979), pp. 218–246] to prove the nonexistence of full reducers for a broad class of queries.
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
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
Cited by
Tarjan, R. E., & Yannakakis, M. (1984) · SIAM Journal on Computing · doi:10.1137/0213035 · Cited by 1,058
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-citationAn Introduction to Chordal Graphs and Clique Trees
Blair, J. R. S., & Peyton, B. (1993) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-1-4613-8369-7_1 · Cited by 377
A comparison of structural CSP decomposition methods
Gottlob, G., Leone, N., & Scarcello, F. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00078-3 · Cited by 328
Metadata
- Authors
- Bernstein, P. A., & Goodman, N.
- Venue
- SIAM Journal on Computing
- Published
- 1981-11
- Volume
- 10
- Issue
- 4
- Pages
- 751-771
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2046649829
- Cited by
- 226
- References
- 1
- FWCI
- 21.53
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.