{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220703","sets":["6504:11035:11038"]},"path":["11038"],"owner":"44499","recid":"220703","title":["ロックフリー索引BzTreeにおける並列一括挿入法の実装"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-02-17"},"_buckets":{"deposit":"e4d50f2c-7390-413c-8a6d-4092e00033d9"},"_deposit":{"id":"220703","pid":{"type":"depid","value":"220703","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ロックフリー索引BzTreeにおける並列一括挿入法の実装","author_link":["577480","577478","577479","577481"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ロックフリー索引BzTreeにおける並列一括挿入法の実装"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"データとウェブ","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2022-02-17","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名大"},{"subitem_text_value":"名大"},{"subitem_text_value":"名大"},{"subitem_text_value":"名大"}]},"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/220703/files/IPSJ-Z84-2N-01.pdf","label":"IPSJ-Z84-2N-01.pdf"},"date":[{"dateType":"Available","dateValue":"2022-10-22"}],"format":"application/pdf","filename":"IPSJ-Z84-2N-01.pdf","filesize":[{"value":"663.4 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"d7be6600-25e3-4d85-a27b-09c4f52fcc0f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"中山, 宗"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"杉浦, 健人"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"石川, 佳治"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"陸, 可鏡"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Bz木はmulti-word compare-and-swap命令を用いたロックフリーアルゴリズムに 基づくB+木である．Bz木の提案論文では基礎的な読み書きのAPIに関する記述は ある一方，一括挿入法は提案されていない．しかし，運用開始時における索引の 構築時間の削減は重要な課題である．そこで，本論文ではBz木における一括挿入 法を提案する．提案手法では，一括挿入時には挿入されるレコードがあらかじめ 全て把握できる点に着目し，まず挿入されるレコードを整列する．その後，葉 ノードからボトムアップにBz木を構築することで，構造変更の頻度を抑えながら Bz木全体を構築する．提案する一括挿入法と個々にデータを挿入した際との性能 を比較し，提案手法の有効性を示す．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"484","bibliographic_titles":[{"bibliographic_title":"第84回全国大会講演論文集"}],"bibliographicPageStart":"483","bibliographicIssueDates":{"bibliographicIssueDate":"2022-02-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2022"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:20:44.042565+00:00","updated":"2025-01-19T14:27:53.990964+00:00","id":220703}