Hierarchical commitment algorithm for permanent time stamp ordering

Abstract

Permanent time stamp ordering is one of the concurrency control mechanism for a distributed database system. It can guarantee that transaction can be processed in the order of arrival. According to this method, the transaction is temporally committed when it has been processed, and it is truly committed when its timestamp becomes less than the least timestamp of the processing transactions. In this paper, we propose a hierarchical commitment algorithm for permanent timestamp ordering and we also show that our new algorithm is superior to traditional centralized or distributed commitment algorithms with respect to the response time of the transaction.