Database Management Systems

This is the complete FREE FULL COURSE of DATABASE MANAGEMENT SYSTEMS [DBMS]. This course is helpful for Computer Science and Engineering CSE Students, Electronics and Communication Engineering ECE students, Information Technology IT Students to prepare for their regular university exams, GATE, UGC NET, SET and other competitive exams. This course is also helpful for those who are preparing for software job and campus placements.
The entire course is broadly divided into sections.

Section 1: Introduction to Database
Section 2: Entity Relationship Diagrams Design of Databases
Section 3: Relational Database Design
Section 4: Structured Query Language SQL
Section 5: Relational Algebra and Relational Calculus
Section 6: Normalization
Section 7: Physical Schema

Section 1: Introduction to Database Management Systems DBMS.

This section deals with all the basic terminology used in this entire course. Here we will learn all the basic definitions of Data, Database, Database Management Systems, and the difference between the file systems and database management systems.

Section 2: Entity Relationship Diagrams Design of Databases

In this section we will learn what is ER Diagram, how to draw the ER Diagrams from the requirements collected. For better understanding we explained these concepts with a real-world example. We have taken a company database and considered some requirements for that company and we convert those requirements into ER Diagram.

In the process of understanding design of databases using ER Diagram we explained all the basic definitions like Entity, Attribute, Entity Type, Simple Attributes, Composite Attributes, Single and Multi-valued Attributes, Stored and Derived attributes, key attributes of an entity type in a detailed way.

We have discussed the complex concepts of ER Diagrams like Identifying the Entity types, relationship type, cardinality ratio, participation constraint, one to one relationship, one to many, and many to many relationships, recursive relationship, MIN MAX notations of the ER Diagram clearly.

Section 3: Relational Database Design

In this section we will convert the ER Diagram obtained in our previous section to database schema. Here we will how the referential integrity constraint using foreign keys, multi-valued attributes, one to one, one to many, and many to many relationships of the ER Diagram to database schema.

Section 4: Structured Query Language SQL

Here we have explained all the SQL commands to CREATE TABLE, INSERT INTO, ALTER TABLE, ADD and DROP Table or constraint using Alter Table, truncate and Drop table, and SELECT commands in a detailed way.

We have covered all the basic keywords of SQL like IS NULL, IS NOT NULL, BETWEEN, NOT BETWEEN, IN NOT IN, AND OR NOT, LIKE, CONCAT, UPPER, LOWER, RPAD, LPAD, LTRIM, RTRIM, LENGTH, SUBSTR, INSTR, ABS, ROUND, TRUNC, NVL, AVG, COUNT, MAX, MIN, SUM and DATE Functions, like ADD MONTHS, GREATEST, LEAST, NEXT_DAY, LAST_DAY, MONTHS_BETWEEN, ORDER BY, DISTINCT in a detailed way with an example.

We have also discussed the us Cartesian Product in SQL to write the SQL queries efficiently. We also discussed the concepts of Nested Queries Correlated Nested Queries in a detailed way.

We have also discussed the concepts of JOINS like INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL JOIN in a detailed way.

Section 5: Relational Algebra and Relational Calculus

In this section we have discussed the concepts of Relational Algebra like Rename, Union, Intersection, Set Difference, Cartesian Product, Inner join, Theta join, Equi join, Outer join, Left outer join, Outer join, Full outer join, Division operator in a very clear way.

We also discussed the concepts Relational calculus, Types of relational calculus, Existential Quantifier, Universal Quantifier, Transforming Universal and Existential Quantifier, Relationally complete language, Safe and unsafe expressions, Tuple relational calculus, Domain relational calculus, in a very detailed way.

Section 6: Normalization

In this section we will discuss how a database can be normalized to avoid redundancy and anomalies.

We have discussed the basic of normalization functional dependencies, Super key, Key, Candidate Key, Primary Key, Armstrong Axiom’s, closure of functional dependency, determining candidate keys clearly.

Next in this section we have discussed the concepts of First Normal Form 1NF, Second Normal Form 2NF, Third Normal Form 3NF, Boyce Codd normal Form BCNF, Fourth Normal Form 4NF, and Fifth Normal Form 5NF, Lossless Decomposition, Dependency preserving in a detailed way.

Section 7: Physical Schema

In this section we have discussed the physical aspects of Databases in a detailed way.

The concepts that we have discussed in this section are Memory hierarchy, Storage devices, Records, Record types, Blocking factor, Spanned versus Unspanned Records, Files of unordered records and ordered records, Primary indexing, Secondary indexing, and Clustering Indexes in a clear way.