Serializability

• It is a concurrency scheme where the concurrent transaction is equivalent to one that executes the transactions serially.
• A schedule is a list of transactions.
• Serial schedule describes each transaction is executed consecutively without any interference from other transactions.
• Non-serial schedule defines the operations from a group of concurrent transactions that are interleaved.
• In non-serial schedule, if the schedule is not proper, then the problems can arise like multiple update, uncommitted dependency and incorrect analysis.
• The main purpose of serializability is to find non-serial schedules that allow transactions to execute concurrently without interference and produce a database state that could be produced by a serial execution.
• Serializability is the concurrency scheme where the concurrent transaction is equivalent to one that executes the transactions serially. Serial schedule defines each transaction is executed consecutively without any interference from other transactions.

States of Transactions

• Schedule – The chronological execution sequence of a transaction is called a schedule.
• Serial Schedule − It is a schedule in which transactions are aligned in such a manner that one transaction is executed first. When the first transaction complete its cycle then the next transaction is executed. Transactions are ordered one after the other. This is called a serial schedule, as transactions are executed in a serial manner.