Transactions Crossword Puzzle

Download and print this "Transactions" crossword puzzle, or solve it online directly in your browser. For the printable version, use a pencil or pen to fill in the answers. The completed answers are included, so you can easily check your work when you're finished.

PDF will include puzzle sheet and the answer key.

ATOMICITY : A property that ensures a transaction is treated as a single unit, either fully completed or not at all
ISOLATION : Ensures that concurrently executing transactions do not interfere with each other
DURABILITY : Guarantees that once a transaction commits, its changes are permanent even after a failure
CONSISTENCY : Ensures that a transaction brings the database from one valid state to another
ACTIVE : The initial state of a transaction when it starts execution
COMMITTED : The state indicating successful execution and permanent saving of a transaction's changes
ABORT : The state where a transaction is rolled back due to failure or error
SERIALIZABILITY : The concept that ensures concurrent transactions produce the same result as some serial execution
CONFLICT SERIALIZABILITY : A type of serializability that considers conflicts between operations to determine schedule validity
VIEW SERIALIZABILITY : A relaxed serializability that ensures the same final results as a serial schedule
PRECEDENCE GRAPH : A directed graph used to test whether a schedule is conflict-serializable
TWOPHASELOCKING : A concurrency protocol that divides execution into growing and shrinking phases
STRICT2PL : A stricter variant of 2PL that holds all locks until transaction commit to avoid cascading rollbacks
TIMESTAMP PROTOCOL : A concurrency control method that orders transactions using timestamps
DEADLOCK : A situation where two or more transactions wait indefinitely for each other's resources

Edit Print PDF - Letter PDF - A4 Play Online

Related puzzles:

More Computers / IT Crossword Puzzles

Techcrunch Chronology
Internet and E-Travel Commerce
Computer Networks
Internet Security Terms
Search Engine Optimisation

Browse all Computers / IT Puzzles

QUESTIONS LIST:

atomicity : a property that ensures a transaction is treated as a single unit, either fully completed or not at all
isolation : ensures that concurrently executing transactions do not interfere with each other
durability : guarantees that once a transaction commits, its changes are permanent even after a failure
consistency : ensures that a transaction brings the database from one valid state to another
active : the initial state of a transaction when it starts execution
committed : the state indicating successful execution and permanent saving of a transaction's changes
abort : the state where a transaction is rolled back due to failure or error
serializability : the concept that ensures concurrent transactions produce the same result as some serial execution
conflict serializability : a type of serializability that considers conflicts between operations to determine schedule validity
view serializability : a relaxed serializability that ensures the same final results as a serial schedule
precedence graph : a directed graph used to test whether a schedule is conflict-serializable
twophaselocking : a concurrency protocol that divides execution into growing and shrinking phases
strict2pl : a stricter variant of 2pl that holds all locks until transaction commit to avoid cascading rollbacks
timestamp protocol : a concurrency control method that orders transactions using timestamps
deadlock : a situation where two or more transactions wait indefinitely for each other's resources