Data Modeling

Syllabus
16 September 2023 10:41 AM
1.1 Introduction to DBMS Page 1

Data, Database and DBMS

Database Systems v/s File Systems

ACID, Advantages and applications of DBMS
16 September 2023 02:47 PM

Data Abstraction, Terminologies
16 September 2023 03:56 PM

DBMS Architecture
28 October 2023 10:31 AM

Server System Architecture
28 October 2023 11:33 AM

DBMS Classification
28 October 2023 12:04 PM

Database Design
28 October 2023 12:57 PM

Data Modeling
29 October 2023 11:24 AM
1.2 Data Modeling Page 24

Entity Relationship model
29 October 2023 11:44 AM

ER Model Components
29 October 2023 12:33 PM

Extended ER Model
07 November 2023 12:14 PM

Create ERD
29 October 2023 06:28 PM

Keys
29 October 2023 06:25 PM

Relational Model

Codd's Rules

Syllabus
2. Database Design Page 47

Functional Dependencies

Inference rules

Functional dependency closure

Minimal / Canonical Cover

Decomposition

Normalization

Syllabus
3. Query Language Page 65

Relational Algebra
Operation Purpose
(Symbols)
Select(σ) The SELECT operation is used for selecting a subset of the tuples according to a
given selection condition
Projection(π) The projection eliminates all attributes of the input relation but those mentioned in
the projection list.
Union UNION is symbolized by symbol. It includes all tuples that are in tables A or in B.
Operation(∪)
Set Difference(-) The result of A – B, is a relation which includes all tuples that are in A but not in B.
Intersection(∩) Intersection defines a relation consisting of a set of all tuple that are in both A and
B.
Cartesian Cartesian operation is helpful to merge columns from two relations.
Product(X)
Inner Join Inner join, includes only those tuples that satisfy the matching criteria.
Theta Join(θ) The general case of JOIN operation is called a Theta join. It is denoted by symbol θ.

Theta Join(θ) The general case of JOIN operation is called a Theta join. It is denoted by symbol θ.
EQUI Join When a theta join uses only equivalence condition, it becomes a equi join.
Natural Join() Natural join can only be performed if there is a common attribute between the
relations.
Outer Join In an outer join, along with tuples that satisfy the matching criteria.
Left Outer Join( ) In the left outer join, operation allows keeping all tuple in the left relation.
Right Outer join( ) In the right outer join, operation allows keeping all tuple in the right relation.
Full Outer Join( ) In a full outer join, all tuples from both relations are included in the result
irrespective of the matching condition.

Relational Algebra : Operations and Joins

`

`

SQL

DDL, DML

DCL, TCL, DQL

Aggregate, Numerical, Date, String functions
23 November 2023 10:45 AM

SQL Joins

Nested queries

SQL Stored procedure

SQL Functions

Function Stored Procedure
Always returns a single value; Can return zero, single or multiple values.
either scalar or a table.
Functions are compiled and Stored procedures are stored in parsed and compiled
executed at run time. state in the database.
Only Select statements. DML Can perform any operation on database objects
statements like update & insert including select and DML statements.
are not allowed.
Allows only input parameters. Allows both input and output parameters
Does not allow output
parameters.
parameters.
Does not allow the use of Allows use of Try…Catch blocks for exception handling.
Try…Catch blocks for exception
handling.
Cannot have transactions Can have transactions within a stored procedure.
within a function.
Cannot call a stored procedure Can call a function from a stored procedure.
from a function.
Functions can be called from a Stored procedures cannot be called from a Select/Where
Select statement. or Having statements. Execute statement has to be used
to execute a stored procedure.
Functions can be used in JOIN Stored procedures cannot be used in JOIN clauses
clauses.

Triggers and Views

Syllabus
4.1 Storage and Querying Page 102

Overview of Physical Storage System

File Structure

Indexing

Query Processing & Optimization

Syllabus
4.2 Transaction Management Page 116

Intro and ACID

State Diagram

DBMS Schedules

Serializability

Syllabus
5. Parallel and distributed DBs Page 131

Parallel DBMS

Parallel DBMS Architecture

I/O Parallelism

Partitioning Techniques

Inter, Intra...

Distributed Databases

Distributed Data Storage

Syllabus
6. Data Warehousing Page 146

Introduction

Architecture and Components

OLAP

OLAP Types

Big Data

No - SQL

QB
06 December 2023 04:47 PM
Q1] What is Inter query parallelism and Intra query parallelism?
Q2] Explain ACID properties.
Q3] Explain approaches for storing the relation in distributed data storage?
Q4] Write the types of fragmentation?
Q5] Explain Computer system Memory Hierarchy Concept.
Q.6] What are different types of physical storage systems available for databases?
Q.7]Explain DBMS architecture Components in detail.
Q.8]Write a short note on File structures.
Q.9]Explain concept of Indexing.
Q.10] Differentiate B tree and B+ tree indexing scheme.
Q.11]Write short note on Query processing and Query optimization.
Q.12] Explain CAP theorem.
Q.13]What do you mean by Serializability? Explain Conflict serializability?
Q.14] What is the need of View serializability? Explain with suitable example.
Q.15]Explain different types of schedules in transaction management.
Q.16]Explain Parallel database architectures.
Q.17] What are different types of Distributed database system.?
Q.18]Write a short note on partitioning techniques.
Q.19]Write a short note on Query Processing and Query Optimization.
Q.20]SQL vs NOSQL databases
Q.21]Explain Different types of NOSQL databases with suitable examples.
Q.22]Describe Data warehouse architecture in details along with diagram.
Q.23] What do you mean by OLAP. Differentiate between OLAP VS OLTP.
QB Page 164

Data Modeling

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data Modeling

Uploaded by

Copyright:

Available Formats

Syllabus

16 September 2023 10:41 AM

1.1 Introduction to DBMS Page 1

1.1 Introduction to DBMS Page 2

1.1 Introduction to DBMS Page 4

1.1 Introduction to DBMS Page 6

1.1 Introduction to DBMS Page 8

1.1 Introduction to DBMS Page 10

1.1 Introduction to DBMS Page 14

1.1 Introduction to DBMS Page 15

1.1 Introduction to DBMS Page 18

1.2 Data Modeling Page 24

1.2 Data Modeling Page 25

1.2 Data Modeling Page 27

1.2 Data Modeling Page 30

1.2 Data Modeling Page 32

1.2 Data Modeling Page 35

1.2 Data Modeling Page 40

1.2 Data Modeling Page 43

2. Database Design Page 47

2. Database Design Page 48

2. Database Design Page 51

2. Database Design Page 54

2. Database Design Page 56

2. Database Design Page 58

2. Database Design Page 60

3. Query Language Page 65

3. Query Language Page 66

3. Query Language Page 67

3. Query Language Page 68

3. Query Language Page 69

3. Query Language Page 71

3. Query Language Page 74

3. Query Language Page 77

3. Query Language Page 82

3. Query Language Page 85

3. Query Language Page 88

3. Query Language Page 91

3. Query Language Page 93

3. Query Language Page 96

3. Query Language Page 98

3. Query Language Page 99

4.1 Storage and Querying Page 102

4.1 Storage and Querying Page 103

4.1 Storage and Querying Page 106

4.1 Storage and Querying Page 110

4.1 Storage and Querying Page 113

4.2 Transaction Management Page 116

4.2 Transaction Management Page 117

4.2 Transaction Management Page 121

4.2 Transaction Management Page 123

4.2 Transaction Management Page 126

5. Parallel and distributed DBs Page 131

5. Parallel and distributed DBs Page 132

5. Parallel and distributed DBs Page 135

5. Parallel and distributed DBs Page 136

5. Parallel and distributed DBs Page 137

5. Parallel and distributed DBs Page 139

5. Parallel and distributed DBs Page 140

5. Parallel and distributed DBs Page 143

6. Data Warehousing Page 146

6. Data Warehousing Page 147

6. Data Warehousing Page 150

6. Data Warehousing Page 153