Optimistic-Concurrency-Control

Optimistic-Concurrency-Control - Merger of Semi-Committed...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Optimistic Concurrency Contro Merger of Semi-Committed Transactions From Several Partitions Combine DCG, DCG 2 , --- DCG N (minimize rollback if cycle exists) NP-complete (Davidson, Princeton) (minimum feedback vertex set problem) Consider each DCG as a single transaction Check acyclicity of this N node graph (too optimistic!) Assign a weight to transactions in each partition Consider DCG 1 with maximum weight Select transactions from other DCG’s that do not create cycles
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Optimistic Concurrency Contro Two Choices Abort transactions who create cycles Consider each transaction that creates cycle one at a time. Abort transactions which optimize rollback (complexity O(N 3 )) Minimization not necessarily optimal globally
Background image of page 2
Optimistic Concurrency Contro Semantics of Transaction Computation Commutative Give $5000 bonus to every employee Commutativity can be predetermined or recognized dynamically Maintain log (REDO/UNDO) of commutative and noncommutative actions Partially rollback transactions to their first noncommutative action
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 8

Optimistic-Concurrency-Control - Merger of Semi-Committed...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online