A data base sublanguage founded on the relational calculus

@inproceedings{Codd1971ADB,
  title={A data base sublanguage founded on the relational calculus},
  author={E. F. Codd},
  booktitle={SIGFIDET '71},
  year={1971}
}
  • E. Codd
  • Published in SIGFIDET '71 1971
  • Computer Science
Three principal types of language for data base manipulation are identified: the low-level, procedure-oriented (typified by the CODASYL-proposed DML), the intermediate level, algebraic (typified by the Project MAC MacAIMS language), and the high level, relational calculus-based data sublanguage, an example of which is described in this paper. The language description is informal and stresses concepts and principles. Following this, arguments are presented for the superiority of the calculus… Expand
Relational Completeness of Data Base Sublanguages
  • E. Codd
  • Computer Science
  • Research Report / RJ / IBM / San Jose, California
  • 1972
TLDR
This paper attempts to provide a theoretical basis which may be used to determine how complete a selection capability is provided in a proposed data sublanguage independently of any host language in which the sublanguage may be embedded. Expand
Specifying queries as relational expressions: the SQUARE data sublanguage
TLDR
A data sublanguage called SQUARE, intended for use in ad hoc, interactive problem solving by non-computer specialists, and is shown to be relationally complete; however, it avoids the quantifiers and bound variables required by languages based on the relational calculus. Expand
Embedding a relational data sublanguage in a general purpose programming language
TLDR
EQUEL is a programming language which embeds the relational data sublanguage QUEL into the general purpose programming language “C” and two operational subsystems written in this combined language are described. Expand
Embedding a relational data sublanguage in a general purpose programming language
TLDR
EQUEL is a programming language which embeds the relational data sublanguage QUEL into the general purpose programming language “C” and two operational subsystems written in this combined language are described. Expand
A comparison of the use of links and secondary indices in a relational data base system
TLDR
This paper presents a formal model of a mix of interactions in one non procedural relational language and shows that option 2) is never preferred to both @@@@ and 3) over the range of model parameters, Hence, the sole use of sets or “links” as a performance oriented access path is questionable. Expand
A high level data sublanguage for a context-addressed segment-sequential memory
TLDR
A high-level data sublanguage called SLICK is presented for the manipulation and retrieval of data from normalized and unnormalized (hierarchically structured) relational tables and eliminates the need for using extra variables, and allows retrieval operations to be performed directly on un normalized tables. Expand
Fundamental And Secondary Issues In The Design Of Non-Procedural Relational Languages
  • A. Pirotte
  • Computer Science
  • Fifth International Conference on Very Large Data Bases, 1979.
  • 1979
TLDR
Results of an analysis of languages and attempts to evaluate various criteria as to their capability of accounting for differences among languages are summarized. Expand
A data sublanguage for formulation of linear mathematical models
  • J. Choobineh, J. Sena
  • Computer Science
  • [1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track
  • 1988
TLDR
The database language SQL is extended to allow the specification of constraints, computed attributes, triggers, and optimizations for mathematical linear programming problems and a macro architecture for the implementation of the system is proposed. Expand
Relational level data structures for programming languages
  • J. Earley
  • Computer Science
  • Acta Informatica
  • 2004
TLDR
A high level of data structure description for programming languages which is called the relational level is described, which involves the use of an implementation facility to allow the programmer to specify the implementation of his relational level structures in terms of access path and machine level structures using a “structured programming” approach. Expand
An integrated data base language
TLDR
Care has been taken to ensure that the language HYPOL helps in writing structured programs, and in arriving at this language the capability concept has been used to define access control requirements of a user. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
Relational Completeness of Data Base Sublanguages
  • E. Codd
  • Computer Science
  • Research Report / RJ / IBM / San Jose, California
  • 1972
TLDR
This paper attempts to provide a theoretical basis which may be used to determine how complete a selection capability is provided in a proposed data sublanguage independently of any host language in which the sublanguage may be embedded. Expand
File definition and logical data independence
TLDR
This paper presents an architecture for a data base system which is capable of providing data independence at two levels, viz physical and logical, and employs a schema and subschema which contains the definitions of an application program's logical files. Expand
Data base task group report to the CODASYL programming language committee
TLDR
The specification of separate Data Description and Data Manipulation Languages is significant in that it allows databases described by the Data Description Language to be independent of the host languages used for processing the data. Expand
Unacceptable file operations in a relational data base
TLDR
It is argued that most violative file operations should be rejected and the equivalent operationsshould be carried out on projections in E. F. Codd's 'third normal form' in order to alleviate the necessity for spurious side effects. Expand
Tramp: An interpretive associative processor with deductive capabilities
In recent years; it has become increasingly clear that there is need for a content-addressable computer memory. Larger and larger programs are being written which require a structured data base toExpand
A Tutorial on Data-Base Organization
Abstract The purpose of this report is to clarify certain issues of data-base support. The main issues are data independence, security, integrity, search, and the integrated data base. The firstExpand
Storage structure and physical data independence
TLDR
It is demonstrated in particular that the number of possible conformable representations of the data base is potentially very large, and that certain advantages accrue from the choice of a conformable representation. Expand
A computer system for inference execution and data retrieval
This paper presents a RAND project concerned with the use of computers as assistants in the logical analysis of large collections of factual data. A system called the Relational Data File wasExpand
The MacAIMS data management system
TLDR
The MacAIMS Data Management System (MADAM) is based on a relational model of data, and employs set-theoretic primitive operations for manipulating data. Expand
Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)
TLDR
This paper describes how a method has been devised for maintaining hierarchical associations within logical entries of a data base within the Time-Shared Data Management System (TDMS), and permits the automatic association of related data through a device known as a repeating group. Expand
...
1
2
3
...