IAE Academy

Transactions formulas

Transactions and concurrency control. 2 formulas for GATE CS, DA Database Management and Warehousing, each with when to use it. Each is explained in the topic notes.

All 2 Transactions formulas

NUMBER OF POSSIBLE SCHEDULES (INTERLEAVINGS)

For k transactions with n1, ..., nk operations each, keeping each transaction's own order and counting only the order of operations, not their legality. Non-serial schedules = this number minus k!. Example: two transactions with 2 and 3 operations give 5!/(2! 3!) = 10 schedules, of which 2 are serial and 8 non-serial.

NUMBER OF SERIAL SCHEDULES OF K TRANSACTIONS

Every ordering of whole transactions is one serial schedule.

Where this was asked: 2020 (1), 2022 (1), 2024 (3), 2025 (3), 2026 (1). See the 9 previous-year questions on Transactions. This shows what was asked, not what will be asked.

KEEP GOING

Transactions: the notes and 9 solved previous-year questions