Selection (relational algebra)

In relational algebra, a selection (sometimes called a restriction to avoid confusion with SQL's use of SELECT) is a unary operation written as$sigma\_\{a\; heta\; b\}(\; R\; )$ or $sigma\_\{a\; heta\; v\}(\; R\; )$ where:
* $a$ and $b$ are attribute names
* $heta$ is a binary operation in the set
* $v$ is a value constant
* $R$ is a relation

The selection $sigma\_\{a\; heta\; b\}(\; R\; )$ selects all those tuples in $R$ for which $heta$ holds between the $a$ and the $b$ attribute.

The selection $sigma\_\{a\; heta\; v\}(\; R\; )$ selects all those tuples in $R$ for which $heta$ holds between the $a$ attribute and the value $v$.

For an example, consider the following tables where the first table gives the relation $Person$, the second table gives the result of $sigma\_\{Age\; ge\; 34\}(\; Person\; )$ and the third table gives the result of $sigma\_\{Age\; =\; Weight\}(\; Person\; )$.

|

More formally the semantics of the selection is defined asfollows:

: $sigma\_\{a\; heta\; b\}(\; R\; )\; =\; \{\; t\; :\; t\; in\; R,\; t(a)\; heta\; t(b)\; \}$

: $sigma\_\{a\; heta\; v\}(\; R\; )\; =\; \{\; t\; :\; t\; in\; R,\; t(a)\; heta\; v\; \}$

The result of the selection is only defined if the attribute names that it mentions are in the heading of the relation that it operates upon.

In computer languages it is expected that any truth-valued expression be permitted as the selection condition rather than restricting it to be a simple comparison.

In SQL, selections are performed by using WHERE definitions in SELECT, UPDATE, and DELETE statements, but note that the selection condition can result in any of three truth values ("true", "false" and "unknown") instead of the usual two.

ee also

* Generalized selection