A precise definition of basic relational notions and of the relational algebra
- 1 September 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 13 (1) , 30-45
- https://doi.org/10.1145/984514.984516
Abstract
This paper presents a precise definition of basic relational notions as well as a precise and general definition of the relational algebra. The paper also illustrates a method for developing semi-formal definitions of data models. A nearly formal definition of relations with unordered attributes is given, and algebraic operations are described as operating on and producing relations thus defined. The definition of algebric operations contains, as a special case, the "classical" definition of the algebra (see e.g. [CODD72]). But, in addition, several operations are generalized. The closure of the algebra is characterized precisely, with the help of an operation for renaming relation attributes.Keywords
This publication has 6 references indexed in Scilit:
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- A primer on relational data base conceptsIBM Systems Journal, 1981
- Associating types with domains of relational data basesPublished by Association for Computing Machinery (ACM) ,1980
- Extending the database relational model to capture more meaningACM Transactions on Database Systems, 1979
- Generalized joinsACM SIGMOD Record, 1976
- An algebra of relations for machine computationPublished by Association for Computing Machinery (ACM) ,1975