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

Database, 3. (10 points) Assume that you have been presented with the follo...

3. (10 points) Assume that you have been presented with the following relation for the Baxter Aviation database: Charters (Pilot#, Pilot name, Aircraft ID#, #seats, Village, Fligh

Data modelling and normalization methodology, MOSS VALE is a town with 1500...

MOSS VALE is a town with 15000 inhabitants. The fire department wishes to develop a system that automates the despatch of fire engines to attend fires. The ERD below describes the

Define upgrade and downgrade, Define upgrade and downgrade? It gives a ...

Define upgrade and downgrade? It gives a mechanism for conversion from shared lock to exclusive lock is called as upgrade. It gives a mechanism for conversion from exclusive

Design an algorithm to implement operations, Design an algorithm to impleme...

Design an algorithm to implement operations  Each and every operation specified in the functional model could be formulated as an algorithm. The algorithm indicates how operat

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

Draw an e-r diagram and convert it to a relational schema, In an organisati...

In an organisation various projects are undertaken. Each projects can employ one or more employees. Every employee can work on one or more projects. Each project is undertaken on

Explain the integrity constraints, Explain the integrity constraints: Not N...

Explain the integrity constraints: Not Null,  Unique, Primary Key with an example each. Is the combination 'Not Null, Primary Key' a valid combination. Justify. Not Null - Shou

Differentiate sub-class and super-class, Differentiate sub-class and super-...

Differentiate sub-class and super-class? The specialization of a class is known as subclasses.eg: employee is a subclass of person and teller is a subclass of employee. Convers

Describe the algorithm to draw the dependency graph, Describe the algorithm...

Describe the algorithm to draw the dependency graph?   Ans: Algorithm to draw Precedence Graph is like this: a.  For every transaction T i participating in schedule S, make

Explain the equijoin, Explain the θ-join and equijoin Refer tables Car ...

Explain the θ-join and equijoin Refer tables Car and Boat which list models of cars and boats and their relevant prices. Assume a customer wants to buy a car and a boat, but sh

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