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
Describe Physical Data independence ? Physical Data Independence - It is capacity to modify the internal schema without having to change conceptual schema. Therefore, the exter

Using your cache simulator and using smalltex.din as your memory trace determine the total miss rate, compulsory miss rate, capacity miss rate, and conflict miss rate for the follo


Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set: Entity set that


Process of implementing system design in dynamic models There are three essential approaches to implementing system design in dynamic models. These approaches are as below:

What is transaction? Collections of operations that form a single logical unit of work are known as transactions.

Define granularity, hierarchy of granularity of locks & multiple granularity locking. Explain the modified two phase locking along with multiple granularity locking. Ans: The s

let us consider a table having 2200 records and the fixed size of the table to be considered as 25.then how many numbers of table is requredto perform horizontal fragmentation

In the architecture of a database system which external level used? In the architecture of a database system view external level used.