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
INSERT INTO command : Values can be inserted for all columns or for the selected columns Values can be given by sub query. In place of values parameter substitution

Example: Consider the following relations: ROLLNO NAME ADDRESS COURSE_ID 100 Ka

Sequences Sequences: Automatically produce unique numbers Are sharable Are typically used to make a primary key value Replace application code Speed up t

prototype of a distributed information system for a national car part retail outlet chain.

WHAT IS MEANT BY E-R MODEL

What is Nested Queries explain in details? Nested Queries - A SELECT query could have subquery(s) in it. While a SELECT query having another SELECT query in it, is known as n

Discuss the term- Design Optimization  We have seen various ways of representing the objects.The fundamental design model uses analysis model as the framework for implementati

Determine the minimal set of functional dependencies for the following data. This table is part of the OHSU database of extracurricular activities and tracks the DMICE band's co

Forward Recovery (Redo): In this system the committed changes made by a transaction are reapplied to a previous copy of the database.                          In simpler

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