SERIALIZABILITY IN DBMS

This video discusses the Serializability concepts such as Conflict Serializability and View Serializability. The serializability is used to find if the given non-serial schedule is a serializable schedule or non-serializable schedule.
Conflict Serializability is used to check whether a given non-serial schedule is conflict serializable or not.
It performs this process by converting the given non-serial schedule into a serial schedule by swapping its non-conflicting operations
If two transactions are performing
Operations are on the different data items – Non conflict operations

Operations are on the same data item ( Conflict / Non conflict operations – 4 cases)
T1 T2
read(Q) read(Q) – Non Conflict
read(Q) write(Q) -- Conflict
write(Q) read(Q) – Conflict
write(Q) write(Q) -- Conflict

View Serializability is a process to find out that a given schedule is view serializable or not.
If a Schedule is View Equivalent to its serial schedule, then it is view realizable.
 
View Equivalent
Two schedules S1, a non-serial schedule and S2, a serial schedule are said to be view equivalent, if they satisfy all the following conditions:

i.e, if in both the schedules S1 & S2, the transactions that performs
Initial Read
Final Write and
Update Read
on each data item are same.

This channel has the videos for the below given topics:

UNIT - I
Database System Applications: A Historical Perspective, File Systems versus a DBMS, the Data Model, Levels of Abstraction in a DBMS, Data Independence, Structure of a DBMS
Introduction to Database Design: Database Design and ER Diagrams, Entities, Attributes, and Entity Sets, Relationships and Relationship Sets, Additional Features of the ER Model, Conceptual Design With the ER Model

UNIT - II
Introduction to the Relational Model: Integrity constraint over relations, enforcing integrity constraints, querying relational data, logical data base design, introduction to views, destroying/altering tables and views.
Relational Algebra, Tuple relational Calculus, Domain relational calculus.

UNIT - III
SQL: QUERIES, CONSTRAINTS, TRIGGERS: form of basic SQL query, UNION, INTERSECT, and EXCEPT, Nested Queries, aggregation operators, NULL values, complex integrity constraints in SQL, triggers and active data bases.

Schema Refinement: Problems caused by redundancy, decompositions, problems related to decomposition, reasoning about functional dependencies, FIRST, SECOND, THIRD normal forms, BCNF, lossless join decomposition, multi-valued dependencies, FOURTH normal form, FIFTH normal form.

UNIT - IV
Transaction Concept, Transaction State, Implementation of Atomicity and Durability, Concurrent Executions, Serializability, Recoverability, Implementation of Isolation, Testing for serializability, Lock Based Protocols, Timestamp Based Protocols, Validation- Based Protocols, Multiple Granularity, Recovery and Atomicity, Log–Based Recovery, Recovery with Concurrent Transactions.

UNIT - V
Data on External Storage, File Organization and Indexing, Cluster Indexes, Primary and Secondary Indexes, Index data Structures, Hash Based Indexing, Tree base Indexing, Comparison of File Organizations, Indexes and Performance Tuning, Intuitions for tree Indexes, Indexed Sequential Access Methods (ISAM), B+ Trees: A Dynamic Index Structure.

[baravind]

simply the best.. i tried to search for the best, simple and easy explanation. its just amazing. thank you so much mam.

[supriyahr]

You have explained in the way that we can easily understand ✨ step by step, thank you mam 🤩

[KondraguntaNaveen]

I am going to write the same question in my model thanku for your greate explanation😊

[prachipatil]

Thanks mam🙏Step by step explanation technique is nice

[Dharani-kv]

I clearly understand this concept because of you thank you ma'am ❤✨

[kavyaaselvalashmi]

should we not swap write(q) from t2 to first operation in eg:2 for view serializable then it is view serializable ryt??