A novel timestamp ordering approach for co-existing traditional and cooperative transaction processing

Abstract

In order to support both traditional short transaction and long cooperative transactions, we propose a novel timestamp ordering approach. With this timestamp ordering method, short transactions can be processed in the traditional way, as if there are no cooperative transactions, therefore not be blocked by long transactions; cooperative transactions will not be aborted when there is a conflict with short transactions, rather it will incorporate the recent updates into its own processing; and the serializabilities, among short transactions, and between a cooperative transaction (group) and other short transactions, are all preserved.