{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T06:10:29Z","timestamp":1698127829521},"reference-count":4,"publisher":"Wiley","issue":"9","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":5558,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1992,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper proposes a permanent time\u2010stamp 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\u2010stamp ordering mechanism and confirms the validity of the algorithm.<\/jats:p>","DOI":"10.1002\/scj.4690230901","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T00:14:03Z","timestamp":1183853643000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Permanent time\u2010stamp ordering mechanism"],"prefix":"10.1002","volume":"23","author":[{"given":"Shinya","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hikaru","family":"Nakanishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshikazu","family":"Tezuka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Furukawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/356842.356846"},{"key":"e_1_2_1_3_2","volume-title":"A control mechanism realizing a service in the order of requests","author":"Furukawa M.","year":"1990"},{"key":"e_1_2_1_4_2","first-page":"D\u201073","volume-title":"A proposal of permanent time\u2010stamp ordering mechanism realizing a service in the order of requests","author":"Furukawa M.","year":"1990"},{"key":"e_1_2_1_5_2","unstructured":"Y.KambayashiandX.Zhong.Controllable time\u2010stamp ordering and oriental time\u2010stamp ordering concurrency control mechanisms. Proc. IEEE COMPSAC pp.554\u2013560(Oct.1987)."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690230901","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690230901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T14:03:02Z","timestamp":1698069782000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690230901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":4,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1002\/scj.4690230901"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690230901","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}