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 b+ tree, Explain the B + tree? B + tree is a type of tre...

Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is

What is meant by heuristic optimisation, What is meant by heuristic optimis...

What is meant by heuristic optimisation?  Discuss the main heuristics that are applied during query optimisation.  Ans:  In heuristic optimization, heuristics are employed to r

The second normal form (2nf), The Second Normal Form (2NF) Definition: ...

The Second Normal Form (2NF) Definition: A relation is in 2NF if it is in 1NF and each non-key attribute is fully dependent on each candidate key of the relation. Some of th

Example of sequences, Example : Create a sequence named SEQSS that starts a...

Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000.  CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA

Wound-wait scheme-deadlock prevention, " Wound-wait" scheme : It is based o...

" Wound-wait" scheme : It is based on a preemptive method. It is based on a simple rule:                   If Ti requests a database resource that is held by Tj

Database project, A database to track your progress in your college program...

A database to track your progress in your college program will track your progress towards graduation! A database that has information containing the classes that you have taken, c

Define radix conversion method, Define Radix conversion method  One cle...

Define Radix conversion method  One clever way to transform binary numbers to BCD notation (binary-coded decimal) is the "double dabble algorithm". It can be adapted to transfo

Relational database, Consider the following relational database: STUDENT (n...

Consider the following relational database: STUDENT (name, student#, class, major) COURSE (course name, course#, credit hours, department) SECTION (section identifier, course#, sem

Discuss difference between drop table r and delete from r, Discuss The diff...

Discuss The difference between drop table R and delete from R.  DROP TABLE command deletes all the records with the table definition. This command will automatically committed

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