{"id":161759,"updated":"2025-01-20T11:47:40.199852+00:00","links":{},"created":"2025-01-19T00:34:28.555299+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00161759","sets":["6504:8672:8729"]},"path":["8729"],"owner":"6748","recid":"161759","title":["節点の遷移集合に着目した自由領域管理による高速なダブル配列構築法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-03-10"},"_buckets":{"deposit":"5c47b69e-141e-49e2-a10b-ac2e4c49f2f6"},"_deposit":{"id":"161759","pid":{"type":"depid","value":"161759","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"節点の遷移集合に着目した自由領域管理による高速なダブル配列構築法の提案","author_link":["314796","314797"],"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":"2016-03-10","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/161759/files/IPSJ-Z78-2L-04.pdf","label":"IPSJ-Z78-2L-04.pdf"},"date":[{"dateType":"Available","dateValue":"2016-05-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-Z78-2L-04.pdf","filesize":[{"value":"108.3 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":"b4f3fda2-2de3-4ea5-9810-496b032e767f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 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":"高速な検索手法であるトライ木を実装するデータ構造としてダブル配列がある．ダブル配列は各節点から遷移可能な遷移種の集合を一次元配列上で組み合わせた構造をとるため，遷移集合が当てはまる位置を検索する必要があり，膨大な時間計算量を要する．そこで，使用頻度の高い遷移集合が当てはまる位置をあらかじめ分類しておくことで，位置の検索に要する計算量を抑制し，構築の高速化をはかる．実験ではWikipediaのタイトル集合を用いて，遷移集合検索の比較回数と構築時間との相関関係を評価する．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"580","bibliographic_titles":[{"bibliographic_title":"第78回全国大会講演論文集"}],"bibliographicPageStart":"579","bibliographicIssueDates":{"bibliographicIssueDate":"2016-03-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2016"}]},"relation_version_is_last":true,"weko_creator_id":"6748"}}