PROJECT Operation in Relational Algebra Last Updated : 12 Jul, 2025 Comments Improve Suggest changes Like Article Like Report Prerequisite - Relational Algebra Project operation selects (or chooses) certain attributes discarding other attributes. The Project operation is also known as vertical partitioning since it partitions the relation or table vertically discarding other columns or attributes. Notation: πA(R) where 'A' is the attribute list, it is the desired set of attributes from the attributes of relation(R), symbol 'π(pi)' is used to denote the Project operator, R is generally a relational algebra expression, which results in a relation. Example - πAge(Student)πDept, Sex(Emp) Example - Given a relation Faculty (Class, Dept, Position) with the following tuples: Class Dept Position 5 CSE Assistant Professor 5 CSE Assistant Professor 6 EE Assistant Professor 6 EE Assistant Professor 1. Project Class and Dept from Faculty - πClass, Dept(Faculty) Class Dept 5 CSE 6 EE Here, we can observe that the degree (number of attributes) of resulting relation is 2, whereas the degree of Faculty relation is 3, So from this we can conclude that we may get a relation with varying degree on applying Project operation on a relation. Hence, the degree of resulting relation is equal to the number of attribute in the attribute list 'A'. 2. Project Position from Faculty - πPosition(Faculty) Position Assistant Professor Here, we can observe that all the duplicate tuples are removed from the relation in the resulting relation. This is called as Duplicate elimination. 3. Project Class from Faculty - πClass(Faculty) Class 5 6 Important points: The Project operation removes duplicate tuples. The Project operation is not commutative, that is : πAttribute List 1(πAttribute List2(R)) != πAttribute List 2 (πAttribute List1(R)) The following expression is valid only if Attribute List 1 is a subset of Attribute List 2. πAttribute List 1(πAttribute List2(R)) Moreover, writing the above expression is as good as writing the expression below: πAttribute List 1(πAttribute List2(R)) = πAttribute List 1 (R) The cardinality (number of tuples) of resulting relation from a Project operation is: 1 <= πA(R) <= |R| The degree (number of attributes) of resulting relation from a Project operation is equal to the number of attribute in the attribute list 'A'. In SQL, SELECT DISTINCT query is exactly as same as PROJECT here. Comment More infoAdvertise with us Next Article Cartesian Product Operation in Relational Algebra B bikashdutta Follow Improve Article Tags : DBMS GATE CS Write From Home Similar Reads Cartesian Product Operation in Relational Algebra Prerequisite â Relational AlgebraWe already are aware of the fact that relations are nothing but a set of tuples, and here we will have 2 sets of tuples.On applying CARTESIAN PRODUCT on two relations that is on two sets of tuples, it will take every tuple one by one from the left set(relation) and w 3 min read SELECT Operation in Relational Algebra Prerequisite - Relational Algebra Select operation chooses the subset of tuples from the relation that satisfies the given condition mentioned in the syntax of selection. The selection operation is also known as horizontal partitioning since it partitions the table or relation horizontally. Notation 2 min read SELECT Operation in Relational Algebra Prerequisite - Relational Algebra Select operation chooses the subset of tuples from the relation that satisfies the given condition mentioned in the syntax of selection. The selection operation is also known as horizontal partitioning since it partitions the table or relation horizontally. Notation 2 min read Basic Operators in Relational Algebra The Relational Model is a way of structuring data using relations, which are a collection of tuples that have the same attributes. Relational Algebra is a procedural query language that takes relations as input and returns relations as output. Here, we'll explore the basic operators of Relational Al 4 min read Basic Operators in Relational Algebra The Relational Model is a way of structuring data using relations, which are a collection of tuples that have the same attributes. Relational Algebra is a procedural query language that takes relations as input and returns relations as output. Here, we'll explore the basic operators of Relational Al 4 min read Basic Operators in Relational Algebra The Relational Model is a way of structuring data using relations, which are a collection of tuples that have the same attributes. Relational Algebra is a procedural query language that takes relations as input and returns relations as output. Here, we'll explore the basic operators of Relational Al 4 min read Like