A Risk-Free Multiversion Temporally Correct Algorithm
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Improving Concurrency Control in Distributed Databases with Predeclared Tables
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
| Hi-index | 0.00 |
In some scenarios involving on-line transaction processing within a distributed database, it is desirable to synchronize transactions in a manner that guarantees conflict equivalence with a serial schedule ordered by original transaction start times while providing each transaction with an anomaly serializable isolation. Few theoretical concurrency control algorithms guarantee such conflict equivalence, and we are unaware of any protocol that accomplishes this while supporting real-world issues such as out-of-order transaction messages, out-of-order operation executions, and out-of-order transaction committals without the burden of explicit readset and writeset declarations. We describe an algorithm that provides this guarantee and supports these issues while requiring only table-level writeset declarations.