Mô tả

Welcome to the course "Database Management System(DBMS) & SQL : Complete Pack 2023".

If you want learn RDBMS concepts from scratch to advance level then confidently I can say that you are in right place. Here every topic taught from very basic and all possible insights discussed from each corner for every topic along with many examples for better understanding. Definitely you will master database concepts by the end of the course and you will become good database engineer.

Course Objectives:

The objective of the course is to present an introduction to database management systems, with an  emphasis on how to organize, maintain and retrieve - efficiently, and effectively - information from a DBMS.

Learning Outcomes:

Upon successful completion of this course, you should be able to:

• Describe the fundamental elements of relational database management systems

• Explain the basic concepts of relational data model, entity-relationship model, relational database design, relational algebra and SQL.

• Design ER-models to represent simple database application scenarios

• Convert the ER-model to relational tables, populate relational database and formulate SQL queries on data.

• Improve the database design by normalization.

• Familiar with basic database storage structures and access techniques: file and page organizations, indexing methods including B tree, and hashing.


UNIT- I

Database System- concepts and architecture: Data modelling using the Entity Relationship (ER) modelling and Enhanced Entity Relationship (EER) modelling, Specialization and Generalization.

UNIT-II

The Relational Model: Relational database design using ER to relational mapping, Relational algebra and relational calculus, Tuple Relational Calculus, Domain Relational Calculus, SQL.

UNIT-III

Database design theory and methodology: Functional dependencies and normalization of relations, Normal Forms, Properties of relational decomposition, Algorithms for relational database schema design.

UNIT-IV

Transaction processing concepts: Schedules and serviceability, Concurrency control, Two Phase Locking Techniques, Optimistic Concurrency Control, Database recovery concepts and techniques.

UNIT-V

Data Storage and indexing: Single level and multi level indexing, Dynamic Multi level indexing using B Trees and B+ Trees.

Important information before you enroll!

  • Once enrolled, you have unlimited, 24/7, lifetime access to the course (unless you choose to drop the course during the first 30 days).

  • You will have instant and free access to any updates I'll add to the course - video lectures, additional resources, quizzes, exercises.

  • You will benefit from my full support regarding any question you might have 7 days a week.

  • Check out the promo video at the top of this page and some of the free preview lectures in the curriculum to get a taste of my teaching style and methods before making your decision.

Come and join me, you will get definitely great learning experience and you will master the course. Thank you.

Bạn sẽ học được gì

Describe the fundamental elements of relational database management systems.

Explain the basic concepts of relational data model, entity-relationship model, relational database design, relational algebra and SQL.

Design ER-models to represent simple database application scenarios

Improve the database design by normalization.

Concurrency control( from scratch to advance).

Database indexing ( B and B+ Trees).

Able to create complex SQL queries using multiple tables.

In-depth knowledge over database design or database engineer.

Learn core concepts of database design.

Capable to answer any level of competitive exams like GATE, ISRO, PSU's or any other.

Yêu cầu

  • No Prerequisites.

Nội dung khoá học

10 sections

Keys : Candidate key, Primary key, Super key, Foreign Key.

6 lectures
Types of keys.
02:44
Candidate Key
06:07
Primary Key
02:40
Alternate Key
01:17
Super Key
04:09
Foreign Key
06:07

Entity - Relationship Model ( ER Model).

9 lectures
Introduction.
04:37
Entity : Strong and Weak Entity.
06:39
Attribute : Key attribute, Simple and Composite Attributes.
06:16
Attribute : Single and Multi-valued Attributes & Stored and Derived Attributes.
04:23
Relationship : Introduction, Weak Relationship.
03:32
Relationship : Degree - Unary, Binary, Ternary and n-ary Relationships.
03:34
Relationship:Cardinality-One:One(1:1),One:Many(1:M),Many:One(M:1),Many:Many(M:M)
07:54
Relationship : Partial and Total Participation & Cardinality Ratio.
08:33
Example 1,2 : Min,Max Cardinality, Partial & Total Participation, Relationship.
08:21

Functional Dependency (FD).

26 lectures
Functional Dependency : Introduction, Examples
13:24
Types of Functional Dependencies : Trivial and Non-Trivial FD's.
03:41
FD : Example.
06:19
Inference Rules
07:42
Attribute Closure : Example 2
07:17
Attribute Closure : Example 3
08:11
Attribute Closure : Example 4
04:22
Applications of Attribute Closure
03:45
Application 1 : Finding additional FD's
03:07
Application 2 : Finding keys in a relation - Example 1 & 2.
08:27
Application 2 : Finding keys in a relation - Example 3 & 4.
03:49
Application 2 : Finding keys in a relation - Example 5 & 6.
02:57
Application 2 : Finding keys in a relation - Example 7 & 8.
02:24
Application 2 : Finding keys in a relation - Example 9 & 10.
05:12
Application 2 : Finding keys in a relation - Example 11 & 12.
05:31
Application 2 : Finding keys in a relation - Example 13 & 14.
04:37
Find candidate keys.
2 questions
Application 3 : Equivalence of Functional Dependencies - Example 1
07:32
Application 3 : Equivalence of Functional Dependencies - Example 2
03:32
Application 3 : Equivalence of Functional Dependencies - Example 3
02:21
Application 3 : Equivalence of Functional Dependencies - Example 4
04:30
Application 4 : Irreducible set and Algorithm.
06:53
Application 4 : Irreducible set - Example 1
07:32
Application 4 : Irreducible set - Example 2.
07:39
Partial Functional Dependency and Full Functional Dependency.
10:21
Anomalies : Update, Deletion and Insertion Anomaly.
13:07

Normalization

9 lectures
Normalization : Introduction and types.
06:29
First Normal Form (1NF).
05:16
Second Normal Form ( 2NF).
11:40
2NF : Examples - 1, 2, 3, 4 and NOTE.
11:31
Third Normal Form ( 3NF).
10:22
3NF : Examples - 1, 2.
07:03
3NF : Example - 3.
10:36
3NF : Example - 4.
03:57
Boyce Codd Normal Form ( BCNF).
07:36

Structured Query Language ( SQL ).

26 lectures
SELECT statement structure and evaluation order.
09:56
SELECT clause Syntax and examples.
11:18
DISTINCT keyword in SELECT clause.
05:28
WHERE clause : Introduction.
05:39
WHERE clause : Operators.
07:55
WHERE clause : Logical Operators - AND, OR, NOT.
11:46
WHERE clause : AND, OR, NOT - Together.
07:23
ORDER BY clause : ASC, DESC
07:48
LIKE and Wildcard Operators.
11:54
NULL values and IS NULL & IS NOT NULL.
06:49
Aggregate Functions : SUM(), AVG(), MIN(), MAX().
12:26
Aggregate Functions : COUNT().
04:22
GROUP BY clause.
09:44
GROUP BY clause : Multiple columns
06:00
HAVING clause and rules.
05:01
Set Manipulation Operators : Rules.
05:35
Set Manipulation Operators : UNION, INTERSECTION, MINUS.
09:39
Joins : Introduction, Cross Join.
07:02
Joins : Theta Join / Conditional Join.
07:02
Joins : Equi Join.
03:42
Joins : Natural Join.
09:53
Joins : Self Join
08:39
Outer Join : Introduction.
01:48
Joins : Left Outer Join
05:59
Joins : Right Outer Join
03:53
Joins : Full Outer Join
04:26

SQL : Queries for better understanding.

8 lectures
Query : 1,2,3.
09:57
Query : 4.
04:23
Query : 5.
05:23
Query : 6, 7.
05:23
Query : 8.
04:23
Query : 9.
04:09
Query : 10.
11:18
Query : 11.1, 11.2, 11.3, 11.4.
04:55

Relational Algebra (RA) and Relational Calculus (RC).

18 lectures
Relational Algebra : Introduction.
02:47
RA : Selection and Projection Operators.
12:29
RA : Set Manipulation Operators(Union, Intersection, Difference)
04:10
RA : Set Manipulation Operators - UNION
06:42
RA : Set Manipulation Operators - INTERSECTION.
03:23
RA : Set Manipulation Operators - SET DIFFERENCE.
07:39
RA : Cartesian Product.
09:58
RA : Rename Operator.
04:46
RA : Join introduction and Types.
02:22
RA : Conditional Join / Theta Join
08:40
RA : Equijoin
01:54
RA : Natural Join.
05:08
RA : Outer Join
03:24
RA : Left Outer Join
05:57
RA : Right Outer Join
03:08
RA : Full Outer Join
04:03
RA : Division Operator.
10:54
RA : Division Operator - Example 1, 2.
05:29

Transactions and Concurrency Control.

27 lectures
Transaction : Introduction
05:09
Schedule : Serial and Concurrent Schedules - Definitions.
11:54
Problem : Number of Searial and Concurrent Schedules.
05:55
1. Last update problem : Problems due to concurrency control.
04:23
2. Dirty Read Problem : Problems due to concurrency control.
04:21
3. Unrepeatable Read Problem : Problems due to concurrency control.
01:31
Problem
05:08
Non-recoverable Schedules.
03:17
Recoverable Schedules.
02:36
Cascading Schedules.
03:21
Cascadeless Schedules.
02:57
Strict Schedules
01:47
Relation among Strict, Cascadeless and Recoverable Schedules.
02:54
Problem : 1, 2.
06:01
Problem : 3.
04:46
Problem : 4.
03:57
Problem : 5, 6.
02:21
Problem : 7, 8.
02:59
Classification
05:02
Serializability : Introduction
14:42
Serializability : Number of serial and non-serial schedules.
05:55
Serializability : Types
02:43
Conflict Serializable Schedules : Introduction
19:04
Conflict Serializable Schedule : Example 2, 3.
07:12
test
11:46
test1
11:46
test2
14:15

File Organization

10 lectures
Introduction
04:25
Storage Strategies : Spanned and Unspanned Strategies.
05:09
Records organization in a file.
04:07
Sparse Index and Dense Index.
05:00
Indexing : Introduction.
06:27
Indexing : Primary Indexing.
05:25
Indexing : Primary Indexing - Numerical Problem.
14:15
Indexing : Cluster Index.
02:30
Indexing : Secondary Indexing.
05:19
Indexing : Secondary Indexing - Example.
04:58

Multi-level Indexing : B - Trees and B+ Trees.

10 lectures
B-Tree : Introduction.
05:20
B-Tree : Node structure.
06:30
B-Tree : Order of Node.
04:25
B-Tree : Numerical problem on Order of node.
11:59
B-Tree : Tree creation with example.
16:27
B-Tree : Deletion operation with example.
19:48
B+ Tree : Introduction - Structure, Order of Leaf and Internal Node.
12:59
B+ Tree : Leaf node and Internal node Split.
05:16
B+ Tree : Insertion Operation - Tree Creation.
12:31
B+ - Tree : Numerical problem on Order of node.
16:00

Đánh giá của học viên

Chưa có đánh giá
Course Rating
5
0%
4
0%
3
0%
2
0%
1
0%

Bình luận khách hàng

Viết Bình Luận

Bạn đánh giá khoá học này thế nào?

image

Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!

Get khoá học giá rẻ ngay trước khi bị fix.