Domain relational calculus

In computer science, domain relational calculus (DRC) is a calculus that was introduced by Michel Lacroix and Alain Pirotte as a declarative database query language for the relational data model.[1]

In DRC, queries have the form:

${\displaystyle \{\langle X_{1},X_{2},....,X_{n}\rangle \mid p(\langle X_{1},X_{2},....,X_{n}\rangle )\}}$

where each X_i is either a domain variable or constant, and ${\displaystyle p(\langle X_{1},X_{2},....,X_{n}\rangle )}$ denotes a DRC formula. The result of the query is the set of tuples X₁ to X_n that make the DRC formula true.

This language uses the same operators as tuple calculus, the logical connectives ∧ (and), ∨ (or) and ¬ (not). The existential quantifier (∃) and the universal quantifier (∀) can be used to bind the variables.

Its computational expressiveness is equivalent to that of relational algebra.[2]

Examples

Let (A, B, C) mean (Rank, Name, ID) in the Enterprise relation

and let (D, E, F) mean (Name, DeptName, ID) in the Department relation

All captains of the starship USS Enterprise:

${\displaystyle \left\{\ {\left\langle A,B,C\right\rangle }\mid {\left\langle A,B,C\right\rangle \in \mathrm {Enterprise} \ \land \ A=\mathrm {'Captain'} }\ \right\}}$

In this example, A, B, C denotes both the result set and a set in the table Enterprise.

Names of Enterprise crew members who are in Stellar Cartography:

${\displaystyle {\begin{aligned}\{{\left\langle B\right\rangle }&\mid {\exists A,C\ \left\langle A,B,C\right\rangle \in \mathrm {Enterprise} }\\&\land \ {\exists D,E,F\ \left\langle D,E,F\right\rangle \in \mathrm {Departments} }\\&\land \ F=C\ \land \ E=\mathrm {'Stellar\ Cartography'} \}\\\end{aligned}}}$

In this example, we're only looking for the name, and that's B. The condition F = C is a requirement that describes the intersection of Enterprise crew members AND members of the Stellar Cartography Department.

An alternate representation of the previous example would be:

${\displaystyle \left\{\ {\left\langle B\right\rangle }\mid {\exists A,C\ \left\langle A,B,C\right\rangle \in \mathrm {Enterprise} }\ \land \ {\exists D\ \left\langle D,\mathrm {'Stellar\ Cartography'} ,C\right\rangle \in \mathrm {Departments} }\ \right\}}$

In this example, the value of the requested F domain is directly placed in the formula and the C domain variable is re-used in the query for the existence of a department, since it already holds a crew member's ID.

See also

• Relational calculus

References

1. Michel Lacroix, Alain Pirotte: Domain-Oriented Relational Languages. VLDB 1977: 370-378
2. E. F. Codd: Relational Completeness of Data Base Sub-languages. In R. Rustin, editor, Data Base Systems. Prentice Hall, 1972

External links

• DES – An educational tool for working with Domain Relational Calculus and other formal languages
• WinRDBI – An educational tool for working with Domain Relational Calculus and other formal languages