Question

a formal query language,in view of an assortment of operators for controlling relations
A:Relational algebra
B:Relational intentions
C:Relational Extensions
D:Relational calculus​

Answer 1

this is the answer your answer is a

Answer 2

The correct answer to this question is option A. Relational Algebra.

Explanation:

• Relational algebra is a technical query language, which takes examples of relations as input and produces instances of relations as output.  

• It uses operators to execute queries. An operator can either be unary or binary.  

• Operators receive relations as input and yield relations as output.  

• Relational algebra is completed recursively on relation and intermediary results are also deemed relations.

• Following are the fundamental operations of relational algebra −  

1. Select
2. Project
3. Union
4. Set different
5. Cartesian product
6. Rename