Relational completeness of data base sublanguages

Relational completeness of data base sublanguages (1972)

by E. F. Codd

Venue:	Database Systems
Citations:	143 - 0 self

Datum	Value	Source
TITLE	Relational completeness of data base sublanguages	INFERENCE
AUTHOR NAME	E. F. Codd	SVM HeaderParse 0.2
AUTHOR AFFIL	; IBM Research Laboratory; Computer Sciences; 1	SVM HeaderParse 0.2
AUTHOR ADDR	; San Jose, California	SVM HeaderParse 0.2
ABSTRACT	ABSTRACT: In the near future, we can expect a great variety of languages to be proposed for interrogating and updating data bases. 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. A relational algebra and a relational calculus are defined. Then, an algorithm is presented for reducing an arbitrary relation-defining expression (based on the calculus) into a semantically equivalent expression of the relational algebra. Finally, some opinions are stated regarding the relative merits of calculus-oriented versus algebra-oriented data sublanguages from the standpoint of optimal search and highly discriminating authorization schemes.	SVM HeaderParse 0.2
YEAR	1972	SVM HeaderParse 0.2
VENUE	Database Systems	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	65--98	INFERENCE
CITATIONS	8 found	ParsCit 1.0