Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Repetitions and permutations of columns in the semijoin algebra

Dirk LeindersJan Van Den Bussche — 2009

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Codd defined the relational algebra [E.F. Codd, Communications of the ACM 13 (1970) 377–387; E.F. Codd, Relational completeness of data base sublanguages, in Data Base Systems, R. Rustin, Ed., Prentice-Hall (1972) 65–98] as the algebra with operations projection, join, restriction, union and difference. His projection operator can drop, permute and repeat columns of a relation. This permuting and repeating of columns does not really add expressive power to the relational algebra. Indeed, using the...

Repetitions and permutations of columns in the semijoin algebra

Dirk LeindersJan Van Den Bussche — 2008

RAIRO - Theoretical Informatics and Applications

Codd defined the relational algebra [E.F. Codd, (1970) 377–387; E.F. Codd, Relational completeness of data base sublanguages, in , R. Rustin, Ed., Prentice-Hall (1972) 65–98] as the algebra with operations projection, join, restriction, union and difference. His projection operator can drop, permute and repeat columns of a relation. This permuting and repeating of columns does not really add expressive power to the relational algebra. Indeed, using the join operation,...

Page 1

Download Results (CSV)