Relational algebra

In [[computer science, relational algebra is a family of algebras with a well-founded semantics used for modelling the data stored in relational databases, and defining queries on it.

Description

The main application of relational algebra is providing a theoretical foundation for relational databases, particularly query languages for such databases, chief among which is SQL.

It was first described by Edgar F. Codd while working for IBM.

See also

• Cartesian product
• D (data language specification)
• D4 (programming language) (an implementation of D)
• Database
• Logic of relatives
• Object-role modeling
• Projection (mathematics)
• Projection (relational algebra)
• Projection (set theory)
• Query language
• Relation
• Relation (database)
• Relation algebra
• Relation composition
• Relation construction
• Relational calculus
• Relational database
• Relational model
• SQL
• Theory of relations
• Triadic relation
• Tutorial D
• Tuple relational calculus
• Well-founded semantics

External links

• Relational algebra @ Wikipedia