Scribd
Upload
2 views10 pages

Relational Algebra Versioin

Relational Algebra is a procedural query language that processes relations as input and produces new relations as output through various operations. It is foundational for relational databases and SQL, utilizing concepts such as keys, domains, relations, and attributes to uniquely identify and link data. Key operations include union, intersection, and set difference, which are essential for manipulating data sets.

Uploaded by

farwaakhtarrana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views10 pages

Relational Algebra Versioin

Relational Algebra is a procedural query language that processes relations as input and produces new relations as output through various operations. It is foundational for relational databases and SQL, utilizing concepts such as keys, domains, relations, and attributes to uniquely identify and link data. Key operations include union, intersection, and set difference, which are essential for manipulating data sets.

Uploaded by

farwaakhtarrana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

RELATIONAL ALGEBRA

PRESENTED BY : FOMAYE IQBAL


ROLL NO #152
RELATIONAL ALGEBRA

Relational Algebra is a widely used procedural query language.


 It collects instances of relations as input and gives occurrence of relations
as output. It uses various operation to perform this action.
 Relational algebra operations are performed recursively on a relation.
 The output of these operations is a new relation, which might be formed
from one or more input relations.
KEY CONCEPTS OF
RELATIONAL
ALEGEBRA
KEY CONCEPTS

• Keys are one of the basic requirements of a relational


database model. It is widely used to identify the
tuples(rows) uniquely in the table.
• We also use keys to set up relations amongst various
columns and tables of a relational database
Domain
Relation
s
Attribute
s
DOMAIN

 A domain is a set of values that


can be stored in a column of a
database table.
 A domain is usually defined by a
column's data type, which
determines the kind of values that
can be stored in the column. For
example, a column with a data type
of INTEGER can only store numeric
values
RELATIONS

• A relationship in DBMS is the


way in which two or more data
sets are linked, i.e., any
association between two entity
types is called a relationship.
• So entity takes part in the
relationship, and it is
represented by a diamond
shape.
ATTRIBUTES

• An attribute is a piece of data


that describes an entity. For
example, in a customer
database, the attributes might
be name, address, and phone
number.
• In a product database, the
attributes might be name, price,
and date of manufacture.
RELATIONAL ALGEBRA IN DBMS

• These Set Theory operations are the standard mathematical operations on set. These
operations are Binary operations that are, operated on 2 relations unlike PROJECT,
SELECT and RENAME operations. These operations are used to merge 2 sets in various
ways.
• The set operation is mainly categorized into the following:
1.Union operation
2.Intersection operation
3.Set difference or Minus operation
RELATIONAL ALGEBRA IN SQL AND DATABASE

• Relational Algebra is a procedural query language. Relational algebra mainly provides a


theoretical foundation for relational databases and SQL.
• The main purpose of using Relational Algebra is to define operators that transform one or
more input relations into an output relation.

You might also like