Patrick Hall
ABSTRACT
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.
- Boyce, R. F., Chamberlin, D. D., King, W. F. III, Hammer, M. M.: 'Specifying Queries as Relational Expressions: SQUARE', IBM Research Report, RJ 1291, Oct 16 1973.Google Scholar
- Boyce, R. F., Chamberlin, D. D.: 'A Structured English Query Language', IBM Research Report, RJ 1318, March 1974.Google Scholar
- Bracchi, G., Fedeli, A., Paolini, P.: 'A Language for a Relational Data Base Management Systems', Proceedings of the Sixth Annual Princeton Conference on Information Sciences and Systems, 1972.Google Scholar
- Codd, E. F.: 'A Relational Model of Data for Large Shared Data Banks', Comm. ACM 13, June 1970, pp. 377-387. Google ScholarDigital Library
- Codd, E. F.: 'Relational Completeness of Data Base Sublanguages'. in 'Data Base Systems', Editor Rustin, Prentice-Hall, 1972.Google Scholar
- Codd, E. F.: 'Further Normalisation of the Data Base Relational Model', in 'Data Base Systems', Editor Rustin, Prentice-Hall 1972.Google Scholar
- Earley, J.: 'Relational Level Data Structures for Programming Languages'. Acta Informatica 2, 1973, pp. 293-309.Google ScholarDigital Library
- Hall, P. A. V.: 'Common Subexpression Identification in General Algebraic Systems', IBM UKSC Report UKSC0060, August 1974.Google Scholar
- Hitchcock, P.: 'Fundamental Operations on Relations', IBM UKSC Report, UKSC0051, May 1974.Google Scholar
- Hitchcock, P. and Park, D. M. R.: 'Induction Rules and Termination Proofs', in Automata, Languages, and Programming, Editor M. Nivat, North-Holland/Elsevier, 1973, pp. 225-251.Google Scholar
- Lucas, P., Lauer, P., Stigleitner, H., 'Method and Notation for the Formal Definition of Programming Languages', IBM Lab., Vienna, Tech. Rep., TR25.087, June 1968.Google Scholar
- Rissanen, J., Delobel, C.: 'Decomposition of Files, a basis for data storage and retrieval', IBM Research Report RJ 1220, May 1973.Google Scholar
- Stocker, P. M., Dearnley, P. A.: 'Self-organising Data Management Systems', The Computer Journal, Vol. 16, no. 2, pp. 100-105.Google ScholarCross Ref
Recommendations
An algebra of quotient relations
SIGMOD '77: Proceedings of the 1977 ACM SIGMOD international conference on Management of dataAn algebra which operates on partitioned relations is developed. Relation partitioning is achieved by defining equivalence relations on n-ary relations. It is shown that the algebra is as powerful as the original relational algebra, having the advantage ...
’’Corner‘‘ Relations in Allen‘s algebra
This paper proves a key result in the maximality proof of ORD-Horn relations, namely, the fact that any subclass of Allen‘s algebra which contains all atomic relations, is closed under conversion, intersection and composition, and contains a relation which ...
A recursive algebra and query optimization for nested relations
The nested relational model provides a better way to represent complex objects than the (flat) relational model, by allowing relations to have relation-valued attributes. A recursive algebra for nested relations that allows tuples at all levels of ...
Comments