Relational Algebra
- Get link
- X
- Other Apps
Relational Algebra
Relational Algebra is a procedural query language used in relational databases to retrieve and manipulate data. It forms the theoretical foundation of relational database systems and defines a set of operations that take one or more tables (relations) as input and produce a new table as output.
Relational algebra is based on mathematical set theory and operates on relations using well-defined operators. It is mainly used internally by database management systems to process SQL queries.
🔹 Basic Operations in Relational Algebra
-
Selection (σ) – Retrieves rows that satisfy a given condition.
-
Projection (π) – Selects specific columns from a table.
-
Union (∪) – Combines tuples from two relations.
-
Set Difference (−) – Returns tuples present in one relation but not in another.
-
Cartesian Product (×) – Combines all rows from two relations.
🔹 Additional Operations
-
Join (⨝) – Combines related tuples from two tables based on a condition.
-
Intersection (∩) – Returns common tuples from two relations.
-
Rename (ρ) – Renames a relation or its attributes.
Relational algebra is important because it provides a formal framework for query processing and helps in understanding how database queries are executed efficiently.
- Get link
- X
- Other Apps
Comments
Post a Comment