Relational algebra

<database, theory> A family of algebra with a well-founded {semantics} used for modelling the data stored in relational databases, and defining queries on it.

The main operations of the relational algebra are the set operations (such as union, intersection, and cartesian product), selection (keeping only some lines of a table) and the projection (keeping only some columns).

The relational data model describes how the data is structured.

Codd's reduction algorithm can convert from relational calculus to relational algebra.

< Previous Terms Terms Containing relational algebra Next Terms >
Reid, Brian
reincarnation, cycle of
reinvent the wheel
Codd's reduction algorithm
relational algebra
relational calculus
relational data model
relational calculus
relational database
relational database management system
relational data model
relational DBMS