In order to support the interaction between coexisting traditional short tr
ansactions 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 were no cooperative tr
ansactions. Therefore they will not be blocked by cooperative transactions.
Cooperative transactions will not be aborted when there is a conflict with
short transactions. Rather, they will incorporate the recent updates into
their own processing. The serializabilities, among short transactions, and
between a cooperative transaction (group) and other short transactions, are
all preserved.