# relational algebra

Also found in: Dictionary, Thesaurus, Wikipedia.

## 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.

The relational data model describes how the data is structured.

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

This article is provided by FOLDOC - Free Online Dictionary of Computing (

**foldoc.org**)## relational algebra

**(1)**The branch of mathematics that deals with relations; for example, AND, OR, NOT, IS and CONTAINS.

**(2)**In a relational database, a collection of rules for dealing with tables; for example, JOIN, UNION and INTERSECT.

Copyright © 1981-2019 by

**The Computer Language Company Inc**. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.Want to thank TFD for its existence? Tell a friend about us, add a link to this page, or visit the webmaster's page for free fun content.

Link to this page: