{"id":13313,"updated":"2025-01-23T01:17:31.310487+00:00","links":{},"created":"2025-01-18T22:47:25.987198+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00013313","sets":["581:729:732"]},"path":["732"],"owner":"1","recid":"13313","title":["A Concurrency Control Algorithm Using Serialization Graph Testing with Write Deferring"],"pubdate":{"attribute_name":"公開日","attribute_value":"1997-10-15"},"_buckets":{"deposit":"0c17e497-9dae-4a51-9c4a-35c966488117"},"_deposit":{"id":"13313","pid":{"type":"depid","value":"13313","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"A Concurrency Control Algorithm Using Serialization Graph Testing with Write Deferring","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Concurrency Control Algorithm Using Serialization Graph Testing with Write Deferring"},{"subitem_title":"A Concurrency Control Algorithm Using Serialization Graph Testing with Write Deferring","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1997-10-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering Science  Osaka University"},{"subitem_text_value":"Faculty of Engineering Science  Osaka University"},{"subitem_text_value":"Faculty of Engineering Science  Osaka University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering Science, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering Science, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering Science, Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/13313/files/IPSJ-JNL3810013.pdf"},"date":[{"dateType":"Available","dateValue":"1999-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL3810013.pdf","filesize":[{"value":"1.3 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"56dad54a-e45a-446a-be10-6a16cdbdf274","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1997 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Harumasa, Tada"},{"creatorName":"Masahiro, Higuchi"},{"creatorName":"Mamoru, Fujii"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Harumasa, Tada","creatorNameLang":"en"},{"creatorName":"Masahiro, Higuchi","creatorNameLang":"en"},{"creatorName":"Mamoru, Fujii","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Several scheduling algorithms for preserving the consistency of databases have been pro-posed.One of such algorithm is Serialization Graph Testing(SGT).Under SGT a scheduler maintains a graph called a serialization graph(SG).Database consistecy is preserved by ensuring that the SG is acyclic The scheduler checks the acyclicity of the SG for every operation.If the SG comes to contain a cycle the operation is rejected.It is known that SGT achieves higher concurrency than other scheduling algorithms.However it has some drawbacks.First operations are forced to wait for a long time so that the acyclicity of the serialization graph can be checked.Second a phenomenon called cascading aborts may oc-cur;that is one abortion of a transaction may cause other abortions.To deal with the first drawback of SGT we focused on the scheduling algorithm called SGT certification.Under SGT certification a scheduler checks the acyclicity of the SG only once for each transac-tion at its termination.Therefore all operations are executed immediately at the cost of a delay in cycle detection.As regards the second drawback the scheduling method called Optimistic Concurrency Control(OCC)avoids cascading aborts by using internal buffer to defer substantial write operations.However the consistency checking of OCC differs from that of SGT and the concurrency of OCC is not so high.Therefore we applied this write deferment approach to SGT certification.We call our algorithm Serialization Grapa Testing with Write Deferring(SGT-WD).In this paper we present the SGT-WD algorithm and show its correctness.We also evaluate SGT-WD SGT and SGT certification by means of simu-lations on distributed database systems.The simulation results show that SGT-WD is more effective than the others.","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Several scheduling algorithms for preserving the consistency of databases have been pro-posed.One of such algorithm is Serialization Graph Testing(SGT).Under SGT,a scheduler maintains a graph called a serialization graph(SG).Database consistecy is preserved by ensuring that the SG is acyclic,The scheduler checks the acyclicity of the SG for every operation.If the SG comes to contain a cycle,the operation is rejected.It is known that SGT achieves higher concurrency than other scheduling algorithms.However,it has some drawbacks.First,operations are forced to wait for a long time so that the acyclicity of the serialization graph can be checked.Second,a phenomenon called cascading aborts may oc-cur;that is,one abortion of a transaction may cause other abortions.To deal with the first drawback of SGT,we focused on the scheduling algorithm called SGT certification.Under SGT certification,a scheduler checks the acyclicity of the SG only once for each transac-tion,at its termination.Therefore,all operations are executed immediately,at the cost of a delay in cycle detection.As regards the second drawback,the scheduling method called Optimistic Concurrency Control(OCC)avoids cascading aborts by using internal buffer to defer substantial write operations.However,the consistency checking of OCC differs from that of SGT,and the concurrency of OCC is not so high.Therefore,we applied this write deferment approach to SGT certification.We call our algorithm Serialization Grapa Testing with Write Deferring(SGT-WD).In this paper,we present the SGT-WD algorithm and show its correctness.We also evaluate SGT-WD,SGT,and SGT certification by means of simu-lations on distributed database systems.The simulation results show that SGT-WD is more effective than the others.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2003","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1995","bibliographicIssueDates":{"bibliographicIssueDate":"1997-10-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicVolumeNumber":"38"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"データベース"}]},"weko_creator_id":"1"}}