Define the five basic operators of relational algebra, Database Management System

Assignment Help:

Define the five basic operators of relational algebra?

Five 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 eliminated.
R = P ∪ Q
2. Minus (-) - Removes generally 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 belonging to the two relations and consisting of all probable combination of the tuples.
R = P × Q
4. Projection (ππππ) - The projection of a relation is described as a projection of all its tuples over a few set of attributes, i.e., it yields a vertical subset of the relation. It is used to either decrease the number of attributes (degree) in the resultant relation or to reorder attributes. The projection of a relation T on the attribute A is denoted through πA(T).
5. Selection (σσσσ) - Selects only some of the tuples, those satisfy given criteria, from the relation. It yields a horizontal subset of a given relation, i.e., the action is defined over a complete set of attribute names but just a subset of the tuples are involved in the result.
R = σB(P)

 


Related Discussions:- Define the five basic operators of relational algebra

What are the disadvantages of relational data, What are the disadvantages o...

What are the disadvantages of relational data ? Disadvantages • Performance - If the number of tables among that relationships to be established are large and the tables t

Serialisability, Serialisability: Any schedule that makes the similar resul...

Serialisability: Any schedule that makes the similar results as a serial schedule is known as a serialisable schedule. But how can a schedule are determined to be serialisable or n

Define decision tree classifiers, Define decision tree classifiers? As ...

Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as

Oracle, List and explain the memory constructs of the Oracle 12c databases?...

List and explain the memory constructs of the Oracle 12c databases?

Find names of employees, Consider the relations EMP(ENO,ENAME,AGE,BASIC_S...

Consider the relations EMP(ENO,ENAME,AGE,BASIC_SALARY) WORK_IN(ENO,DNO) DEPT(DNO,DNAME,CITY) Express the following queries in SQL (i) Find names of employees who work in a dep

Differentiate between primary and secondary storage, Differentiate between ...

Differentiate between Primary and secondary storage? Primary and secondary storage - Primary storage device stores the data temporarily. Primary storage is commonly used thro

Dml precompiler in database management system, DML Precompiler All th...

DML Precompiler All the DBMS have two basic sets of Languages - Data Definition Language (DDL) that have the set of commands needed to define the format of the data that is b

Define aggregate functions, Define Aggregate functions and what aggregate f...

Define Aggregate functions and what aggregate functions supported by the MySQL To calculate a summary value from a set of individual values and uses one of the functions known

Hashed file organisation, Hashed File Organisation Hashing is the most ...

Hashed File Organisation Hashing is the most common form of purely random access to a database or file. It is also used to access columns that do not have an index as an optimi

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