On ordering transaction commit
Abstract
In this poster paper, we briefly introduce an effective solution to address the problem of committing transactions enforcing a predefined order. To do that, we overview the design of two algorithms that deploy a cooperative transaction execution that circumvents the transaction isolation constraint in favor of propagating written values among conflicting transactions. A preliminary implementation shows that even in the presence of data conflicts, the proposed algorithms outperform other competitors, significantly.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Feb 27, 2016
- Source ID
- 10.1145/3016078.2851191
Entities
People
- Binoy Ravindran
- Mohamed M. Saad
- Roberto Palmieri
Organizations
- Air Force Office of Scientific Research
- Virginia Tech