Relational Algebra
It's a procedural query language , which takes relation as input and generate an output based on the condition . SQL base -> Relational Algebra Operators -> Extract data from database Operations : Selection Projection Union Set Difference Cartesian product Rename (P) Cartesian Product: Return all possible relations Join: Return only the condition matched relation Why not Cartesian Product? -> Join is two types . Inner Join -> Will return the tuples which will be matching with the condition . It is three types Theta Join Equi Join Natural Join Outer Join -> Will return the tuples which will be matching with condition along with other rows that will not be matched . It is three types Left Outer Join Right Outer Join Full Outer Join Equi Join : When theta join uses only equality(=) comparison operator , It is said to be equijoin . Notation: Sigma (Predicate) A*B Natural Join: The result of the natural join is the set of all combinations of tuples in two relations R1 and R2 that are equal on their common attribute names . In equi join , There needs a condition . In natural join , No need of condition . Notation:

It's a procedural query language , which takes relation as input and generate an output based on the condition .
SQL base -> Relational Algebra
Operators -> Extract data from database
Operations :
- Selection
- Projection
- Union
- Set Difference
- Cartesian product
- Rename (P)
Cartesian Product: Return all possible relations
Join: Return only the condition matched relation
Why not Cartesian Product?
->
Join is two types .
- Inner Join -> Will return the tuples which will be matching with the condition . It is three types
Theta Join
Equi Join
Natural Join
- Outer Join -> Will return the tuples which will be matching with condition along with other rows that will not be matched . It is three types
Left Outer Join
Right Outer Join
Full Outer Join
Equi Join :
When theta join uses only equality(=) comparison operator , It is said to be equijoin .
Notation:
Sigma (Predicate) A*B
Natural Join:
The result of the natural join is the set of all combinations of tuples in two relations R1 and R2 that are equal on their common attribute names .
In equi join , There needs a condition . In natural join , No need of condition .
Notation: