Permanent time-stamp ordering mechanism

✍ Scribed by Shinya Kobayashi; Hikaru Nakanishi; Yoshikazu Tezuka; Makoto Furukawa

• Book ID: 104591523
• Publisher: John Wiley and Sons
• Year: 1992
• Tongue: English
• Weight: 739 KB
• Volume: 23
• Category: Article
• ISSN: 0882-1666
• DOI: 10.1002/scj.4690230901

✦ Synopsis

Abstract

This paper proposes a permanent time‐stamp ordering mechanism as a concurrency control mechanism in the distributed database, where transactions are served in the order of their arrivals. In the proposed mechanism, the read time stamp and the write time stamp are recorded on each data item; and when a conflict arises between transaction services, the transaction with a larger time stamp is aborted. This paper describes the algorithm for the permanent time‐stamp ordering mechanism and confirms the validity of the algorithm.