CHAPTER 3 Dbms Flashcards

1
Q

RELATIONAL ALGEBRA

A

Relational algebra is a procedural query language. It gives a step by step process to obtain the result of the query. It uses operators to perform queries.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

UNARY OPERATIONS

A

Theselect, project, and rename operations
are called unary operations, because they operate on one relation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
  1. Select Operation:
A
  • The select operation selects tuples that satisfy a given predicate.
  • It is denoted by sigma (σ).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Project Operation:

A
  • This operation shows the list of those attributes that we wish to appear in the result. Rest of the attributes are eliminated from the table.
  • It is denoted by ∏.

EX. 1. ∏NAME,CITY(CUSTOMER)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Rename Operation:

A
  • The rename operation is used to rename the output relation. It is denoted byrho(ρ).

Example:We can use the rename operator to rename STUDENT relation to STUDENT1.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Cartesian PRODUCT

A
  • The Cartesian product is used to combine each row in one table with each row in the other table. It is also known as a cross product.
  • It is denoted by X.
    1. Notation:EXD
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Union Operation:

A
  • Suppose there are two tuples R and S. The union operation contains all the tuples that are either in R or S or both in R & S.
  • It eliminates the duplicate tuples. It is denoted by ∪.
    1. Notation:R∪S, A union operation must hold the following condition:
  • Duplicate tuples are eliminated automatically.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

SET INTERSECTION :

A
  • Suppose there are two tuples R and S. The set intersection operation contains all tuples that are in both R & S.
  • It is denoted by intersection ∩.
    1. Notation:R∩S
  • IT ELIMINATE OTHER THAN SAME ITEMS

CONDITION :

  1. DOMAIN SHOULD BE SAME
  2. NUMBER OF COLUM REMIAN SAME
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

RELATIONAL MODEL :

A
  1. Relational model can represent as a table with columns and rows.
  2. Each row is known as a tuple. Each table of the column has a name or attribute.

RELATIONAL MODEL REPRESENTS HOW DATA IS STORED IN RELATIONAL DATABASES, A RELATIONAL DATABASE STORES DATA IN FORM OF RELATIONS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

RELATIONAL MODEL CONCEPTS

A
  • RELATION : A RELATION IS A TABLE WITH COLUMS AND ROWS

Attribute:
It contains the name of a column in a particular table.

Tuples :

it contains the values of a Rows in a particular table

  • DOMAIN : A domain isa unique set of values that can be assigned to an attribute in a database
    . For example, a domain of strings can accept only string values.
  • Relational schema:
    A relational schema contains the name of the relation and name of all columns or attributes.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Properties of Relations.

A
  • Each relation cell contains exactly one atomic (single) value
  • Each attribute contains a distinct name
  • Attribute domain has no significance
  • tuple has no duplicate value
  • Order of tuple can have a different sequence
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

WHAT IS RDBMS?

A
  • RDBMS STANDS FOR RELATIONAL DATABASE MANAGMENT SYSTEM
  • RDBMS IS THE BASIS FOR SQL AND ALL MORDEN DATABASE SYSTEM LIKE MS SQL ORACLE
  • IN RDBMS DATA WILL STORE IN TABULAR FORM
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

JOIN : A JOIN STATEMENT IS MAINLY USED TO COMBINE TWO TABLES

A

IN HERE WE ARE GOING TO STUDY ABOUT INNER JOIN , NATURAL JOIN , OUTER JOIN AND THIER TYPES .

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

INNER JOIN :

A

THIS JOIN STATEMENT ONLY CONTAINS THOSE TUPLES THAT SATISFY THE MATCHING CONDITION

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

NATURAL JOIN :

A

IN NATURAL JOIN WE DONT NEED ANY CONDIATION TO JOIN IT SIMPLY COMBINE THE TABLE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

OUTER JOIN

A
  • IT CAN JOIN MATCHING TUPLES ALONG WITH SOME OR ALL TUPLES THAT DO NOT SATISFY THE MATCHING CONDITATION
  • ITS IS AN EXTENSTION OF JOIN
17
Q

LEFT OUTER JOIN

A
  • OMMON DATA WILL BE PRESENT AND IT ALSO ENCLUDES LEFT SIDE TABLE VALUES
  • IT CAN JOIN MATCHING TUPLES ALONG WITH ONLY LEFT SIDE TABLE
18
Q

RIGHT OUTER JOIN :

A
  • COMMON DATA WILL BE PRESENT AND IT ALSO ENCLUDES RIGHT SIDE TABLE VALUES
  • IT CAN JOIN MATCHING TUPLES ALONG WITH ONLY RIGHT SIDE TABLE
19
Q

FULL JOIN

A

IT CONTAIN ALL VALUES OF RIGHT AND LEFT TABLES