Relational algebra, Database Management System

 Relational Algebra is a set of basic operations used to influence the data in relational model. These operations allow the user to specify basic retrieval request. The result of retrieval is a new relation, produced from one or more relations. These operations can be divided  in two categories:

•  Basic Set Operations

1)  UNION

2)  SET DIFFERENCE

3)  INTERSECTION

4)  CARTESIAN PRODUCT

•  Relational Operations

1)   JOIN

2)  PROJECT

3) SELECT

4)  DIVISION

Posted Date: 3/6/2013 5:40:47 AM | Location : United States







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

Write discussion on Relational algebra
Your posts are moderated
Related Questions
Determine the language that needs a user to specify the data to be retrieved with no specifying exactly how to get it is Ans: Non-Procedural DML

Example -Find the employee name, salary, department number and average salary of his/her department, for those employees whose salary is more than the average salary of that depart

Explain the concept of generalization and aggregation in E_R diagrams. Give one example for each one of them? Generalization: Consider extending the entity set account throug

Determine the Disadvantages of file based systems Some of the disadvantages of file based systems are like this: Data redundancy and inconsistency: the dissimilar applic

I am doing research in this area, especially in sime join and join efficacy when several relations have been queried. Relations located in different sites. I need something like n

Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?

What are the two types of blocks in the fixed -length representation? Define them. Anchor block: Have the first record of a chain. Overflow block: Have the records other tha

Design an algorithm to implement operations  Each and every operation specified in the functional model could be formulated as an algorithm. The algorithm indicates how operat

Now that she understands more about the benefits of databases, the play-scheme manager would like to extend the play-scheme database to include data for schools and instructors as

Process-oriented decompositions Process-oriented decompositions divide complex process, task or function into simpler sub processes until they get simple enough to be deal