Relational algebra and calculus, Database Management System

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. 

Posted Date: 7/11/2012 4:06:15 AM | Location : United States







Related Discussions:- Relational algebra and calculus, Assignment Help, Ask Question on Relational algebra and calculus, Get Answer, Expert's Help, Relational algebra and calculus Discussions

Write discussion on Relational algebra and calculus
Your posts are moderated
Related Questions
how to implement hyrise in C plus plus

Illustration of implementation of inheritance Let us take the illustration of implementation of inheritance. Suppose that we are about to implement the Stack class and by now w

Create table employee and enter employee data in SQL? Consider the following relational schemas: EMPLOYEE (EMPLOYEE_NAME, STREET, CITY) WORKS (EMPLOYEE_NAME, COMPANYNAME, SAL

What is Data Storage? The storage structures and access methods used by database system are specified by a set of explanation in a special type of DDL called data storage-defin

How to create a biological database based on viruses. How to decide which attribute should be there in the table and schema? How to identify the primary keys, foreign keys, domain,

waht is a repeating group?


Define shadow paging. An alternative to log-based crash recovery method is shadow paging. This technique requires fewer disk accesses than do the log-based methods.

One-way Associations If an association is only traversed in single direction, then it is known as one-way association. It is implemented as a pointer or an attribute which con

The Transactions- A transaction is definite as the unit of work in a database system. Database systems that deal with a huge number of transactions are also termed as transaction p