Relational algebra and calculus, Database Management System

Assignment Help:

Q. What is relational algebra and calculus? Explain the relational algebra operators :- Selection and predicate, set operation, joins and division.

Sol. Relational Algebra 

It is a procedural query language. It consists of a set of operations that tade one or two relations as input and produce a new relation as their result. The fundamental operations in the relational algebrare :- In addition to these there are several other operations namely : set intersection natural join division and assignment.                                                                                                                                                     

1. Selection and Predicate                                                                                                                                                     (i) Select operation : It selects tuples that satisfy a given predicate. We use a lower case letter sigma to denote selection . The preicate appears as subscript to entity, The argument relation is in parentheses after the query. In general, we allow comparisons using =, =, <, < _, > >, _ in the selection       predicat. We can also combine several predicate in to a larger predicate by using the connectives and or and not.                                                                                                                                                   (ii) Predicate operation :  The predicate operation is a unary operation that returns its argument relation with certain attributes left out. It is denoted by the upper cade Greek letter pi.                                                                                                                                                          

2 Set operation : The set difference operatio denoted by allows us to find tuples that are I one relation but are not in another. We can find all customers of the bank who have an account but not a loan by that branch.                                                                                                                                                                     

3 Natural join : It is a binary operatio that allows us to combine certain selections and a cartesian product into one operation. It is denoted by join symbol.                                                                                                                                                                          

4 Division operation : The division operation denoted by is suited to queries that include the pharase for all. We can obtain all branches in Brooklyn by the expression. 


Related Discussions:- Relational algebra and calculus

Define average seek time, Define average seek time. The average seek ti...

Define average seek time. The average seek time is the average of the seek times, calculated over a sequence of random requests.

Support by adding indexes, Support by Adding Indexes Multiple indexes c...

Support by Adding Indexes Multiple indexes can be used to access a data file by multiple access paths. In such a scheme only single copy of the data is consider, only the numbe

Differance between procedural and non procedural dml, Differance between pr...

Differance between procedural and non procedural DML? Procedural and non procedural DML Procedural DML exactly what data is require and how to obtain those data. Non procedural

Define partial key and primary key, Define Partial Key and Primary Key ...

Define Partial Key and Primary Key A partial key, also known as discriminator, is the set of attributes which can uniquely identify weak entities that are related to similar o

Indexed (indexed sequential) file organisation, Indexed (Indexed Sequential...

Indexed (Indexed Sequential) File Organisation It organises the file like a big dictionary, i.e., records are kept in order of the key but an index is stored which also allows

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

What are the advantages of relational data model, What are the advantages o...

What are the advantages of relational data model? Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer

Cataloguing, differences between a classified catalog and a dictionary cata...

differences between a classified catalog and a dictionary catalog

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