{"id":164183,"updated":"2025-01-20T11:02:21.927684+00:00","links":{},"created":"2025-01-19T00:36:01.614750+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00164183","sets":["6504:8291:8753"]},"path":["8753"],"owner":"6748","recid":"164183","title":["トライ木における節点の深さに基づいたダブル配列構造の構築法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-03-17"},"_buckets":{"deposit":"e7df6680-87b0-47c4-b27e-e54d8acd6421"},"_deposit":{"id":"164183","pid":{"type":"depid","value":"164183","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"トライ木における節点の深さに基づいたダブル配列構造の構築法","author_link":["323085","323084"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"トライ木における節点の深さに基づいたダブル配列構造の構築法"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"データとウェブ","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2015-03-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":"大阪教大"}]},"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/164183/files/IPSJ-Z77-6N-07.pdf","label":"IPSJ-Z77-6N-07.pdf"},"date":[{"dateType":"Available","dateValue":"2016-06-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-Z77-6N-07.pdf","filesize":[{"value":"118.8 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"72d3057e-759a-422d-9dd7-77e0b61cab91","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 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":[{}]}]},"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":"高速な探索手法であるトライ木を実装するデータ構造としてダブル配列がある.ダブル配列は同じキー集合を登録しても,節点の配置順序や,衝突した節点の再配置方法により異なる構造をとり得る.このダブル配列の構造と探索性能との間に関係があると考えて,トライ木でキーを探索する際,比較的頻繁に使用する節点に着目して,トライ木上での深さに基づいて節点を配置する構築手法を提案する.構造を評価する指標として遷移距離を定義し,これを抑制することで探索時間の短縮をはかる.探索時間と遷移距離の相関を評価する.また,構築時間と探索時間について他の構築手法と比較する.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"692","bibliographic_titles":[{"bibliographic_title":"第77回全国大会講演論文集"}],"bibliographicPageStart":"691","bibliographicIssueDates":{"bibliographicIssueDate":"2015-03-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2015"}]},"relation_version_is_last":true,"weko_creator_id":"6748"}}