Multi-version Speculative Concurrency Control with Delayed Commit
Data(s) |
12/09/2011
12/09/2011
27/10/1993
|
---|---|
Resumo |
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. |
Identificador |
Bestavros, 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] |
Idioma(s) |
en_US |
Publicador |
Boston University Computer Science Department |
Relação |
BUCS Technical Reports;BUCS-TR-1993-014 |
Palavras-Chave | #Real-time systems #Time constraints #Database management systems #Concurrency control algorithms #Serializability |
Tipo |
Technical Report |