Relational database systems theory and advanced SQL · Introduction

Introduction

What this guide covers

Introduction Introduction Software Systems Engineering

Overview

Topics covered

Introduction
Database Systems: SQL and Relational Theory
Relational Algebra and Formal Foundations
The classical operators of Relational Algebra
Derivative operations and extensions
Translation from Relational Algebra to ANSI SQL

Related concepts

Main connections

Compatible notation

Mathematical sample in LaTeX

The expression is rendered accessibly, with its LaTeX source preserved below.

\begin{aligned} &\text{Selection (Single):} && \sigma_{\varphi}(R) = \{ t \in R \mid \varphi(t) \text{It's true} \} \\ &\text{Projection (Single):} && \pi_{A_1, \ldots, A_k}(R) = \{ t[A_1, \ldots, A_k] \mid t \in R \} \\ &\text{Producto Cartesiano (Binario):} && R \times S = \{ t_R \circ t_S \mid t_R \in R \land t_S \in S \} \\ &\text{Union (Binary):} && R \cup S = \{ t \mid t \in R \lor t \in S \} \quad (\text{Compatible in scheme}) \\ &\text{Diferencia of Conjuntos (Binario):} && R - S = \{ t \mid t \in R \land t \notin S \} \quad (\text{Compatible in scheme}) \end{aligned}

View LaTeX source

\begin{aligned}
          &\text{Selection (Single):} && \sigma_{\varphi}(R) = \{ t \in R \mid \varphi(t) \text{It's true} \} \\
          &\text{Projection (Single):} && \pi_{A_1, \ldots, A_k}(R) = \{ t[A_1, \ldots, A_k] \mid t \in R \} \\
          &\text{Producto Cartesiano (Binario):} && R \times S = \{ t_R \circ t_S \mid t_R \in R \land t_S \in S \} \\
          &\text{Union (Binary):} && R \cup S = \{ t \mid t \in R \lor t \in S \} \quad (\text{Compatible in scheme}) \\
          &\text{Diferencia of Conjuntos (Binario):} && R - S = \{ t \mid t \in R \land t \notin S \} \quad (\text{Compatible in scheme})
          \end{aligned}