States of Transaction in DBMS

States of Transaction In databases, transactions can be in multiple forms. These forms are shown in the figure below.     Active State The first state of each and every transaction in a database is always in the active state. In the active state, the transaction is being executed. For example, the insertion of data … Read more

Schedule in DBMS

Schedule The series of operations that take place between two transactions is known as schedule. This schedule is used to protect the order of operation in every transaction.   Serial Schedule In a serial schedule, a new transaction is started only after the previous transaction is completed. One transaction must complete its cycle for the … Read more

BCNF Boyce Codd normal form

Boyce Codd normal form (BCNF) Boyce Codd Normal Form is an advanced form of the third natural form and hence is quite stricter than it. If every functional dependency is in the form X → Y, the table is in BCNF. Here, X is the super key to the table. For a table to be … Read more

3NF Third Normal Form

A relation can be in Third normal form if it is in the second normal form and does not have any transitive partial dependency. This form is used to reduce the amount of data duplication. It also increases data integrity. In case there is no transitive dependency for non-prime attributes, it is said to be … Read more

Revolutionary Data Storage Solution: RAID

The Revolutionary Data Storage Solution: RAID Alternative Title: RAID: Superior Data Storage Capacity Meta Title: Reliable RAID Solutions For Your Data Storage Problems Alternative Meta Title: A List Of Best RAID Options To Choose From Meta Description: RAID or Redundancy Of The Independent Disk is the latest solution to data storage issues associated with single … Read more

View Serializability In DBMS

Introduction If a schedule is view equivalent to a serial schedule, then it will be view serializable If the schedule is serializable via conflict, then it shall be view serializable as well. The view serializable which has no conflict serializable has blind writes.   View Equivalent Schedules S1 and schedule S2 will; be view equivalent … Read more

Recoverability Of Schedules In DBMS

It so happens that the transaction fails to execute until completion owing to software issues, hardware problems, or system crash. In such a situation, the failed transaction is rolled back by the rollback operation. However, another transaction may have utilized the value yielded by the failed transaction. Then that transaction will have to be rolled … Read more

Conflict Serializable Schedule in DBMS

Conflict Serializable Schedule When non-conflicting operations swap and transform into a serial schedule, the process is called conflict serializability. Also, when the schedule is conflict equivalent, then only it is conflict serializable.   Operations of Conflicting The operations are conflicting in the following conditions: Both are from different transactions. Both contain the same data. Both … Read more

Checkpoint in DBMS

Checkpoint When all the old logs are deleted from the system and stored permanently in the storage disk, the mechanism is called checkpoint. When the execution of the transaction takes place, the checkpoints are marked acting as a bookmark. After the execution, it creates log files. When the file reaches the checkpoint, the transaction status … Read more

Timestamp Ordering Protocol in DBMS

Timestamp Ordering Protocol The timestamp ordering protocol is helpful in ordering transactions according to their timestamps. The ascending order of the creation of transaction is called the order of transaction. The older transaction is executed first due to high priority. The protocol uses time of system or logical counter to determine transaction timestamp. At the … Read more