{"updated":"2025-01-19T10:27:22.875581+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00232382","sets":["1164:1867:11465:11510"]},"path":["11510"],"owner":"44499","recid":"232382","title":["バッチ最適化法によるBFTデータベースの高性能化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-02-12"},"_buckets":{"deposit":"b5e23035-a7b8-49e1-808a-9c94ddf98187"},"_deposit":{"id":"232382","pid":{"type":"depid","value":"232382","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"バッチ最適化法によるBFTデータベースの高性能化","author_link":["628513","628511","628514","628512"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"バッチ最適化法によるBFTデータベースの高性能化"},{"subitem_title":"Make BFT database high performance by batch optimization method","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ビッグデータ","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-02-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"慶應義塾大学環境情報学部"},{"subitem_text_value":"慶應義塾大学環境情報学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Environment and Information Studies, Keio University","subitem_text_language":"en"},{"subitem_text_value":"Department of Environment and Information Studies, Keio University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/232382/files/IPSJ-OS24162013.pdf","label":"IPSJ-OS24162013.pdf"},"date":[{"dateType":"Available","dateValue":"2026-02-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-OS24162013.pdf","filesize":[{"value":"1.4 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":"11"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"0b9ddbc6-365c-406e-b609-1790e02b7853","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"木田, 碧"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"川島, 英之"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Aoi, Kida","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hideyuki, Kawashima","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10444176","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8795","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ビザンチンフォールトに耐性を持つ分散データベース (BFT データベース)は，そのクラスタを構成するノードの任意の故障 (ビザンチンフォールト) を許容する特性と，トランザクション処理を並行実行できるという特性を兼ね揃えたシステムである．本研究では BFT データベースのトランザクション処理における性能上のボトルネックを通信処理と暗号処理であると考察し，それらの処理の頻度を削減するバッチ最適化法を提案する．提案手法を評価するために，最新の BFT データベースである Basil にバッチ最適化法を適用し実験を行なった．ノードが地理的に分散した環境下で，提案手法は既存手法と比べ最大44倍のスループット，最大 4 倍高速化したレイテンシを示した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Byzantine fault-tolerant distributed database (BFT database) can tolerate arbitrary fault (Byzantine fault) of nodes in a cluster and can execute transactions concurrently. We consider communication and cryptographic processing as performance bottlenecks in transaction processing of the BFT database. So we propose a batch optimization method to reduce the frequency of these processes. In order to evaluate the proposed method, we experiment by applying the batch optimization method to Basil (state-of-the-art BFT database). In an environment where nodes are geographically distributed, the proposed method shows up to 44 times higher throughput and up to 4 times higher latency than the existing methods.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告システムソフトウェアとオペレーティング・システム（OS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-02-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"13","bibliographicVolumeNumber":"2024-OS-162"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:33:13.042505+00:00","id":232382,"links":{}}