s
selection
In relational algebra, unary operation that denotes a subset of a relation
EntityQ7447725
Also known as restriction
- Subclass of
- Part of
Overview
On other databases
2 identifiers linking selection across the web's reference databases
In relational algebra, unary operation that denotes a subset of a relation
Also known as restriction
2 identifiers linking selection across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In database theory, relational algebra is a theory that uses algebraic structures for modeling data and defining queries on it with well founded semantics. The theory was introduced by Edgar F. Codd as part of his relational model of data in 1970.