Multi-version Speculative Concurrency Control with Delayed Commit
1993-014-scc-d...pdf (208.5Kb) Main report
MetadataShow full item record
CitationBestavros, Azer; Wang, Biao. "Multi-version Speculative Concurrency Control with Delayed Commit", Technical Report BUCS-1993-014, Computer Science Department, Boston University, October 1993. [Available from: http://hdl.handle.net/2144/1468]
This paper presents an algorithm which extends the relatively new notion of speculative concurrency control by delaying the commitment of transactions, thus allowing other conflicting transactions to continue execution and commit rather than restart. This algorithm propagates uncommitted data to other outstanding transactions thus allowing more speculative schedules to be considered. The algorithm is shown always to find a serializable schedule, and to avoid cascading aborts. Like speculative concurrency control, it considers strictly more schedules than traditional concurrency control algorithms. Further work is needed to determine which of these speculative methods performs better on actual transaction loads.