Purpose of rename operation in relational algebra tutorial

What a relational algebra will do in this case is, it filters the name, address and class from the STUDENT table for the input ID. In mathematical terms, relational algebra has produced a subset of STUDENT table for the given ID. Relational algebra will have operators to indicate the operations.

*Before going on, this tutorial assumes you already have a basic understanding of the structure of relational databases. Relational algebra is a procedural query language, which consists of a set of operations that take one or two relations as input and produce a new relation as their result. Set of relational algebra operations {?, ?, ?, ?, -, ?} is complete •Other four relational algebra operation can be expressed as a sequence of operations from this set. 1. Intersection, as above 2. Join is cross product followed by select, as noted earlier 3. Natural join is rename followed by join followed by project 4. Bags Versus SetsExtended OperatorsJoins Extended Operators in SQL and Relational Algebra T. M. Murali September 16, 2009 T. M. Murali September 16, 2009 Extended Operators in SQL and Relational Algebra ? author = 'Tutorials.shiksha360.com' (Books ? Articles) Output : yields a relation as result which shows all books and articles written by Shiksha360.com. Rename operation ( ? ) Results of relational algebra are also relations but without any name. The rename operation allows us to rename the output relation. Rename (relational algebra) topic. In relational algebra, a rename is a unary operation written as ? a / b ( R ) {displaystyle ho _{a/b}(R)} where: R is a relation a and b are attribute names b is an attribute of R The result is identical to R except that the b attribute in all tuples is renamed to a. That means it should have strong query language which supports relational algebra. There are three main relational algebras on sets - UNION, SET DIFFERENCE and SET INTERSECT. The same is implemented in database query language using set operators. Relati