Relational
algebra
|
SQL
(Structured Query Language)
|
(i)
The relational algebra is a procedural query language.
|
(i)
SQL is a programming Language for relational databases.
|
(ii)
Relational algebra is performed recursively on a relation and intermediate
results are also considered relations.
|
(ii)
It is used for storing and managing data in RDBMS.
|
(iii)
Relational algebra consists of a set of operations that take one or two
relations as input and produce a new relation as their result.
|
(iii)
SQL consists of a collection of relations, each of which is assigned a unique
name.
|
(iv)
The fundamental operations in the relational algebra are select, project,
union, set difference, Cartesian product and rename.
|
(iv)
SQL uses the set of commands to define database schema. These are- CREATE,
DROP, ALTER. and has three clauses- select, from, where.
|
(v)
Example:
Find
all tuples in which the amount lent is more than 1200.
Ans.:
|
(v)
Example:
Find
the names of all branches in the loan relation.
Ans.:
select branch-name from loan
|
11 March 2018
What are the difference between relational algebra and SQL
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment