Difference between Relational Algebra and Relational Calculus

Relational Algebra and Relational Calculus are both formal query languages used to retrieve data from relational databases. Relational Algebra is procedural (specifies how to get the result), while Relational Calculus is declarative (specifies what result to get). Both are equivalent in expressive power.

Relational Algebra

Relational Algebra is a procedural query language that takes instances of relations as input and yields instances of relations as output. It uses operators to perform queries step by step. The fundamental operations are −

• Select (σ) − Filters rows based on a condition
• Project (π) − Selects specific columns
• Union (∪) − Combines rows from two relations
• Set Difference (−) − Rows in one relation but not the other
• Cartesian Product (×) − Combines every row from two relations
• Rename (ρ) − Renames a relation or its attributes

Relational Calculus

Relational Calculus is a non-procedural (declarative) query language. It tells what to retrieve but not how to retrieve it. It exists in two forms −

• Tuple Relational Calculus (TRC) − Variables represent tuples (rows). Example: { t | P(t) } means "find all tuples t satisfying condition P."
• Domain Relational Calculus (DRC) − Variables represent domain values (individual attributes).

Key Differences

Conclusion

Relational Algebra specifies step-by-step operations to retrieve data (procedural), while Relational Calculus describes the conditions the result must satisfy (declarative). Both are equivalent in expressive power − any query expressible in one can be expressed in the other. SQL is based primarily on Relational Calculus with some Algebra concepts.