Introduction to Relational Algebra
Relational algebra is first described by E.F.Codd and it is a procedural query language. It takes instances of relations as input and yields instances of relations as output. It uses operators to be performed on existing relations to derive result relation. It is similar to normal algebra but the difference is that it uses values instead of numbers and not used as a query language in actual database. It is used to execute query and optimization in relational database. The operators of relational algebra are not same as SQL operators even though they have the same name.
Relational Algebra Operators
- Cartesian Product
Example of Admin table in Relational (more…)
This content is restricted to site members. If you are an existing user, please log in. New users may register below.