Define the basic operations of the relational algebra, Database Management System

Assignment Help:

Define the basic operations of the relational algebra?   

 Ans: Basic operators of relational algebra are:

1. Union (∪) - Selects tuples which are in either P or Q or in both of them.  The duplicate tuples are removed.

R = P ∪ Q

 2. Difference or Minus (-) - eliminates common tuples from the first relation.

R = P - Q 

3.  Cartesian Product or Cross Product (×) - The cartesian product of two relations is the concatenation of tuples that are belonging to the two relations and containing all possible combination of the tuples.

R = P× Q

 4. Projection (π) - The projection of a relation is illustrated as a projection of all its tuples over some set of attributes that is it yields a vertical subset of the relation. The relation's projection T on the attribute A is presented by T [A] or πA(T),.

 5. Selection (σ) - Selects just some of the tuples, those satisfy specified criteria, from the relation. It yields a horizontal subset of a following relation.

R = σB(P)


Related Discussions:- Define the basic operations of the relational algebra

A database administrator'', A database administrator''s responsibilities an...

A database administrator''s responsibilities and data contents

Define weak and strong entity sets, Define weak and strong entity sets? ...

Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set: Entity set that

Weak entity, Entity types that do not have any key attribute, and therefore...

Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by

To eliminate duplicate rows-data manipulation language, To eliminate duplic...

To eliminate duplicate rows (distinct operator)  Example: SELECT DISTINCT DEPTNO FROM EMP;

Define instance and schema, Define instance and schema? Instance: Colle...

Define instance and schema? Instance: Collection of data stored in the data base at a certain moment is Schema: The overall design of the data base is known as the data base

Describe hashing in dbms, Describe Hashing in DBMS? Hashing: Hashing ...

Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))

Explain domain calculus, Explain Domain calculus Domain calculus is one...

Explain Domain calculus Domain calculus is one of the types of the relational calculus. The formal specification of the domain calculus was planned after the development of the

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd