Skip to main content
00:00/00:00
Lecture 39 of 146

First Normal Form (1NF)

Download Course (Free)

Course Content

0 / 146 completed
Section 1: Keys Candidate key, Primary key, Super key, Foreign Key6 videos

Types of keys

4m

Primary Key

6m

Alternate Key

3m

Candidate Key

16m

Super Key

12m

Foreign Key

13m
Section 2: Entity - Relationship Model ( ER Model)9 videos

Introduction

9m

Attribute Single and Multi-valued Attributes & Stored and Derived Attributes

13m

Relationship Introduction, Weak Relationship

6m

Attribute Key attribute, Simple and Composite Attributes

14m

Entity Strong and Weak Entity

14m

Relationship Degree - Unary, Binary, Ternary and n-ary Relationships

7m

Relationship Cardinality-One One(1 1),One Many(1 M),Many One(M 1),Many Many(M M)

25m

Example 1,2 Min,Max Cardinality, Partial & Total Participation, Relationship

22m

Relationship Partial and Total Participation & Cardinality Ratio

24m
Section 3: Functional Dependency (FD)25 videos

Types of Functional Dependencies Trivial and Non-Trivial FD's

16m

Functional Dependency Introduction, Examples

55m

FD Example

25m

Inference Rules

29m

Attribute Closure Example 2

14m

Attribute Closure Example 4

7m

Attribute Closure Example 3

15m

Application 1 Finding additional FD's

5m

Application 2 Finding keys in a relation - Example 3 & 4

5m

Applications of Attribute Closure

4m

Application 2 Finding keys in a relation - Example 1 & 2

19m

Application 2 Finding keys in a relation - Example 7 & 8

3m

Application 2 Finding keys in a relation - Example 5 & 6

4m

Application 2 Finding keys in a relation - Example 9 & 10

10m

Application 2 Finding keys in a relation - Example 11 & 12

10m

Application 2 Finding keys in a relation - Example 13 & 14

8m

Application 3 Equivalence of Functional Dependencies - Example 2

7m

Application 3 Equivalence of Functional Dependencies - Example 3

4m

Application 3 Equivalence of Functional Dependencies - Example 1

20m

Application 3 Equivalence of Functional Dependencies - Example 4

9m

Application 4 Irreducible set - Example 2

16m

Application 4 Irreducible set and Algorithm

19m

Application 4 Irreducible set - Example 1

17m

Partial Functional Dependency and Full Functional Dependency

28m

Anomalies Update, Deletion and Insertion Anomaly

35m
Section 4: Normalization9 videos

First Normal Form (1NF)

14mNow Playing

Normalization Introduction and types

26m

NF Examples - 1, 2, 3, 4 and NOTE

20m

Second Normal Form ( 2NF)

24m

NF Examples - 1, 2

12m

Third Normal Form ( 3NF)

29m

NF Example - 3

21m

NF Example - 4

6m

Boyce Codd Normal Form ( BCNF)

12m
Section 5: Structured Query Language ( SQL )26 videos

DISTINCT keyword in SELECT clause

23m

WHERE clause Introduction

22m

SELECT statement structure and evaluation order

18m

SELECT clause Syntax and examples

41m

WHERE clause Operators

33m

WHERE clause Logical Operators - AND, OR, NOT

55m

WHERE clause AND, OR, NOT - Together

31m

ORDER BY clause ASC, DESC

35m

LIKE and Wildcard Operators

38m

Aggregate Functions SUM(), AVG(), MIN(), MAX()

23m

NULL values and IS NULL & IS NOT NULL

23m

Aggregate Functions COUNT()

7m

GROUP BY clause Multiple columns

20m

Set Manipulation Operators Rules

10m

HAVING clause and rules

15m

GROUP BY clause

29m

Joins Introduction, Cross Join

12m

Joins Theta Join Conditional Join

12m

Set Manipulation Operators UNION, INTERSECTION, MINUS

30m

Joins Equi Join

6m

Outer Join Introduction

2m

Joins Self Join

19m

Joins Left Outer Join

14m

Joins Right Outer Join

9m

Joins Full Outer Join

12m

Joins Natural Join

25m
Section 6: SQL Queries for better understanding8 videos

Query 4

14m

Query 1,2,3

35m

Query 5

17m

Query 8

13m

Query 6, 7

17m

Query 9

13m

Query 11.1, 11.2, 11.3, 11.4

13m

Query 10

41m
Section 7: Relational Algebra (RA) and Relational Calculus (RC)18 videos

Relational Algebra Introduction

4m

RA Set Manipulation Operators(Union, Intersection, Difference)

7m

RA Selection and Projection Operators

25m

RA Set Manipulation Operators - INTERSECTION

12m

RA Set Manipulation Operators - UNION

21m

RA Cartesian Product

20m

RA Rename Operator

7m

RA Set Manipulation Operators - SET DIFFERENCE

23m

RA Join introduction and Types

3m

RA Equijoin

3m

RA Natural Join

11m

RA Conditional Join Theta Join

19m

RA Outer Join

5m

RA Left Outer Join

11m

RA Right Outer Join

6m

RA Full Outer Join

8m

RA Division Operator

22m

RA Division Operator - Example 1, 2

8m
Section 8: Transactions and Concurrency Control25 videos

Schedule Serial and Concurrent Schedules - Definitions

37m

Transaction Introduction

51m

Last update problem Problems due to concurrency control

43m

Problem Number of Searial and Concurrent Schedules

59m

Dirty Read Problem Problems due to concurrency control

43m

Unrepeatable Read Problem Problems due to concurrency control

15m

Non-recoverable Schedules

33m

Recoverable Schedules

26m

Problem

51m

Cascading Schedules

33m

Cascadeless Schedules

30m

Strict Schedules

18m

Problem 3

8m

Relation among Strict, Cascadeless and Recoverable Schedules

28m

Problem 4

6m

Problem 5, 6

4m

Problem 7, 8

4m

Problem 1, 2

1h

Serializability Types

27m

Classification

51m

Serializability Number of serial and non-serial schedules

59m

test1

55m

test

55m

Serializability Introduction

1h 30m

test2

35m
Section 9: File Organization10 videos

Introduction

6m

Storage Strategies Spanned and Unspanned Strategies

9m

Records organization in a file

8m

Sparse Index and Dense Index

11m

Indexing Introduction

9m

Indexing Primary Indexing

13m

Indexing Cluster Index

5m

Indexing Secondary Indexing

10m

Indexing Primary Indexing - Numerical Problem

35m

Indexing Secondary Indexing - Example

12m
Section 10: Multi-level Indexing B - Trees and B+ Trees10 videos

B-Tree Numerical problem on Order of node

28m

B-Tree Order of Node

44m

B-Tree Introduction

53m

B-Tree Node structure

1h 6m

B+ Tree Leaf node and Internal node Split

52m

B+ Tree Introduction - Structure, Order of Leaf and Internal Node

1h 30m

B-Tree Tree creation with example

1h 30m

B-Tree Deletion operation with example

1h 30m

B+ - Tree Numerical problem on Order of node

34m

B+ Tree Insertion Operation - Tree Creation

1h 30m