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

Explain the togaf framework for enterprise architectures, Question: (a)...

Question: (a) With the help of a diagram, explain the TOGAF framework for enterprise architectures. (b) Where would you position enterprise architectures in an enterpri

Need some database of usa and uk, I want Database Of United Kingdom with Cr...

I want Database Of United Kingdom with Criteria of:\r\n\r\n1). Name, Number, City, State, Postal Code, Address, Email id, DOB.\r\n\r\n2). Unsecure Debts only adds Credit Card Payme

Difference between left outer join and right outer join, Difference between...

Difference between LEFT OUTER JOIN and RIGHT OUTER JOIN In left outer join tuples from the left-hand-side relation which do not match any tuple in the right-hand-side relation

Referential integrity constraint - relational constraints, It defines that ...

It defines that the tuple in one relation that refers to another relation must refer to an existing tuple in that relation. This constraint is states on two relations (not essentia

Aggregation, Design a database for an airline.The database must keep track ...

Design a database for an airline.The database must keep track of customers and their reservations,flights and their status, seat assignment on individual flights and, the schedule

Explain two phase locking protocol, Explain Two phase locking protocol ...

Explain Two phase locking protocol A transaction is consider as to follow the two-phase locking protocol if all locking operations precede the first unlock operation in the tra

Which method is used to key transformation, Which method is used to key tra...

Which method is used to key transformation ? A hash method is used to key transformation.

Explain th process to avoid re-computation, Saving Derived Attributes to Av...

Saving Derived Attributes to Avoid Re-computation Data that is derived from other data should be stored in the computed form to avoid re-computation. For this, we could define

Concurrency control, Give the two reasons for allowing concurrency

Give the two reasons for allowing concurrency

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