Explain Relational Algebra.
Answers
Answered by
3
✌✌Hey, mate here is your answer⤵
Relational algebra is a procedural query language, which takes instances of relations as input and yields instances of relations as output. It uses operators to perform queries. An operator can be either unary or binary.
Hope this answer will help you..《《
#Be Brainly#
@1Angel25
Relational algebra is a procedural query language, which takes instances of relations as input and yields instances of relations as output. It uses operators to perform queries. An operator can be either unary or binary.
Hope this answer will help you..《《
#Be Brainly#
@1Angel25
Answered by
1
Relational algebra is a procedural query language, which takes instances of relations as input and yields instances of relations as output. It uses operators to perform queries. An operator can be either unary or binary. They accept relations as their input and yield relations as their output. Relational algebra is performed recursively on a relation and intermediate results are also considered relations.
1Angel25:
Hey, I am girl...
Similar questions