A relational model of data for large shared data banks
Communications of the ACM
Safety and translation of relational calculus
ACM Transactions on Database Systems (TODS)
ACM SIGMOD Record
Relational algebras, logic, and functional programming
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Denotational Definition of the Semantics of DRC, A Domain Relational Calculus
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Final report of the ANSI/X3/SPARC DBS-SG relational database task group
ACM SIGMOD Record
PRTV, an efficient implementation for large relational data bases
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Data base description with a single name category data model
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
User extensions to the peterlee relational test vehicle
VLDB '76 Proceedings of the second international conference on Systems for Large Data Bases
The Peterlee relational test vehicle: a system overview
IBM Systems Journal
| Hi-index | 0.00 |
This paper extends the relational algebra of data bases, presented by Codd [4] and others, in four areas. The first is the use of selector names to remove order dependencies from the columns of a relation. This use of selector names enables us to define a more general class of operations, which include the normal relational operations of union, equi-join etc., as special cases. Thirdly we introduce relations represented algorithmically as well as by a stored set of tuples. Such computed relations cannot always be effectively realised as a finite set of tuples. Finally we consider relational expressions as algorithmic representations of relations and characterize their effectiveness.