Hierarchical commitment algorithm for permanent time stamp ordering

Author

Kobayashi, Shin-ya ; Matsuura, Kouji

Author_Institution

Fac. of Eng., Kanazawa Univ., Japan

fYear

1998

fDate

14-16 Dec 1998

Firstpage

75

Lastpage

82

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

Keywords

concurrency control; database theory; distributed databases; transaction processing; concurrency control mechanism; distributed database system; hierarchical commitment algorithm; permanent timestamp ordering; temporal commitment; transaction processing order; transaction response time; Concurrency control; Database systems; Delay;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Systems, 1998. Proceedings. 1998 International Conference on

Conference_Location

Tainan

ISSN

1521-9097

Print_ISBN

0-8186-8603-0

Type

conf

DOI

10.1109/ICPADS.1998.741022

Filename

741022