Specifying queries as relational expressions: the SQUARE data sublanguage

@article{Boyce1975SpecifyingQA,
  title={Specifying queries as relational expressions: the SQUARE data sublanguage},
  author={R. F. Boyce and D. Chamberlin and W. F. King and Michael Hammer},
  journal={Commun. ACM},
  year={1975},
  volume={18},
  pages={621-628}
}
  • R. F. Boyce, D. Chamberlin, +1 author Michael Hammer
  • Published 1975
  • Computer Science
  • Commun. ACM
  • This paper presents a data sublanguage called SQUARE, intended for use in ad hoc, interactive problem solving by non-computer specialists. SQUARE is based on the relational model of data, and is shown to be relationally complete; however, it avoids the quantifiers and bound variables required by languages based on the relational calculus. Facilities for query, insertion, deletion, and update on tabular data bases are described. A syntax is given, and suggestions are made for alternative… CONTINUE READING
    75 Citations
    A Generalized Implementation Method for Relational Data Sublanguages
    • L. Beck
    • Computer Science
    • IEEE Transactions on Software Engineering
    • 1980
    • 2
    SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
    • 550
    The Predicate Calculus-Language KS as a Query Language
    • 10
    Navigational facilities for relational data base
    • 5
    Conceptual Graphs for a Data Base Interface
    • J. Sowa
    • Computer Science
    • IBM J. Res. Dev.
    • 1976
    • 358
    • PDF
    DEDUCE 2: Further Investigations of Deduction in Relational Data Bases
    • C. Chang
    • Computer Science
    • Logic and Data Bases
    • 1977
    • 89

    References

    SHOWING 1-3 OF 3 REFERENCES
    Relational Completeness of Data Base Sublanguages
    • E. F. Codd
    • Computer Science
    • Research Report / RJ / IBM / San Jose, California
    • 1972
    • 755
    • Highly Influential
    • PDF
    A data base sublanguage founded on the relational calculus
    • 351
    • Highly Influential
    Description of a set-theoretic data structure
    • 61
    • Highly Influential
    • PDF