The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Some high level language constructs for data of type relation
Open accessAbstract
For the extension of high level languages by data types of mode relation, three language constructs are proposed and discussed: a repetition statement controlled by relations, predicates as a generalization of Boolean expressions, and a constructor for relations using predicates. The language constructs are developed step by step starting with a set of elementary operations on relations. They are designed to fit into PASCAL without introducing too many additional concepts.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
A relational model of data for large shared data banks
Codd, E. F. (1983) · Communications of the ACM · doi:10.1145/357980.358007 · Cited by 4,796
Programming with abstract data types
Liskov, B., & Zilles, S. (1974) · Proceedings of the ACM SIGPLAN symposium on Very high level languages - · doi:10.1145/800233.807045 · Cited by 734
The programming language pascal
Wirth, N. (1971) · Acta Informatica · doi:10.1007/bf00264291 · Cited by 716
SEQUEL: A structured English query language
Chamberlin, D. D., & Boyce, R. F. (1976) · Proceedings of the 1976 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control - FIDET '76 · doi:10.1145/800296.811515 · Cited by 584
Zloof, M. M. (1975) · AFIPS National Computer Conference (NCC) · doi:10.1145/1499949.1500034 · Cited by 491
Programming with abstract data types
Liskov, B., & Zilles, S. (1974) · ACM SIGPLAN Notices · doi:10.1145/942572.807045 · Cited by 397
A data base sublanguage founded on the relational calculus
Codd, E. F. (1971) · Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '71 · doi:10.1145/1734714.1734718 · Cited by 372
On the semantics of the relational data model
Schmid, H. A., & Swenson, J. R. (1975) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/500080.500110 · Cited by 147
Cited by
Logical foundations of object-oriented and frame-based languages
Kifer, M., Lausen, G., & Wu, J. (1995) · Journal of the ACM · doi:10.1145/210332.210335 · Cited by 1,450
A language facility for designing database-intensive applications
Mylopoulos, J., Bernstein, P. A., & Wong, H. K. T. (1980) · ACM Transactions on Database Systems · doi:10.1145/320141.320150 · Cited by 485
Khoshafian, S. N., & Copeland, G. P. (1986) · ACM SIGPLAN Notices · doi:10.1145/960112.28739 · Cited by 472
"One size fits all": an idea whose time has come and gone
Stonebraker, M., & Cetintemel, U. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.1 · Cited by 393
Relational database: a practical foundation for productivity
Codd, E. F. (1982) · Communications of the ACM · doi:10.1145/358396.358400 · Cited by 351
Metadata
- Authors
- Schmidt, J. W.
- Venue
- ACM Transactions on Database Systems
- Published
- 1977-09
- Volume
- 2
- Issue
- 3
- Pages
- 247-261
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2110338707
- Cited by
- 338
- References
- 13
- FWCI
- 22.22
- 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: Some high level language constructs for data of type relation. https://app.cochat.ai/papers/10.1145/320557.320568
- The paper
- Schmidt, J. W. (1977). Some high level language constructs for data of type relation. ACM Transactions on Database Systems. https://doi.org/10.1145/320557.320568
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.