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
What is serializability? Explain its types? The data base system must control concurrent implementation of transactions, to ensure that the data base state remains consistent.

What is Conceptual Schema? Conceptual Schema - Conceptual schema elaborates the structure of the overall database for a community of users. It hides the details of physical sto

What is called a query evaluation plan? A sequence of primitive operations that can be used to assess a query is a query evaluation plan or a query implementation plan.

What is Stored Procedure? A stored procedure is a named group of SQL statements that have been previously formed and kept in the server database. Stored procedures accept input

I need a help with my assignment of data envelopment analysis which is due for submission next week on monday the 10th Dec. Will you be able to help so that I can submit it on tim

What are ways of finding out either an update is required or not for derived attributes? The ways to find out an update is required or, not are as: Explicit update

What is meant by normalization of data? It is a process of examining the given relation schemas based on their Functional Dependencies (FDs) and primary key to achieve the prop

Critically evaluate the bulleted list of information-related items in this case study. How are each contradictory to the notion of being an information-literate knowledge worker?

Creation of Indexes Automatically: When a primary key or Unique constraint is show in a table definition then a unique index is formed automatically. Manually: User can

Discuss how the one-to-one associations have to be implemented. Some of properties of associations can be implemented directly by providing suitable declarations of the data me