{"id":17459,"updated":"2025-01-22T23:19:19.739218+00:00","links":{},"created":"2025-01-18T22:50:27.327197+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00017459","sets":["934:1022:1034:1036"]},"path":["1036"],"owner":"1","recid":"17459","title":["圧縮ディジタル探索木における辞書情報更新の高速化手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2006-09-15"},"_buckets":{"deposit":"1f37671a-2436-4b8e-bf72-364fd9c07d4c"},"_deposit":{"id":"17459","pid":{"type":"depid","value":"17459","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"圧縮ディジタル探索木における辞書情報更新の高速化手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"圧縮ディジタル探索木における辞書情報更新の高速化手法"},{"subitem_title":"Fast Computation of Updating Method of a Dictionary for Compression Digital Search Tree","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"研究論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2006-09-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪教育大学"},{"subitem_text_value":"大阪教育大学"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Osaka KyoikuUniversity","subitem_text_language":"en"},{"subitem_text_value":"Osaka KyoikuUniversity","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/17459/files/IPSJ-TOD4713003.pdf"},"date":[{"dateType":"Available","dateValue":"2008-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOD4713003.pdf","filesize":[{"value":"429.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"13"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"b6f48494-f2b7-427b-a5bb-3bdd9659ce77","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2006 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"中村, 康正"},{"creatorName":"望月久稔"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasumasa, Nakamura","creatorNameLang":"en"},{"creatorName":"Hisatoshi, Mochizuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464847","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7799","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ディジタル探索は，自然言語処理システムの辞書情報構築を中心に広く用いられている検索技法である．また，ディジタル探索木には共通接頭辞のみを格納した圧縮ディジタル探索木がある．圧縮ディジタル探索木のデータ構造として高速性とコンパクト性をあわせ持つダブル配列法があるが，他の動的検索法に比べ更新速度が高速であるとはいえない．そこで本論文では，ダブル配列法に対する更新処理の高速化手法を提案する．提案手法では，圧縮ディジタル探索木上の新規節点を管理することにより追加処理を高速化し，高速化にともなう削除時間の増加を抑制する．20万語の辞書データに対する実験を行った結果，従来法と比べ追加処理は高速となり，削除処理は同等となることが分かった．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Digital search is a information retrieval application used widely, such as dictionary information construction of natural language processing system. Digital search tree has compression digital search tree stored only common prefix. As a fast and compact data structure for compression digital search tree, a double窶殿rray is presented. However, the updating processing is not faster than other dynamic retrieval methods. In this paper, we presents a faster method of updates for double-array. In the proposed method, we make insertion algorithm fast by managing a new node position on a compression digital search tree, and reduction algorithm of deletion time. The simulation results for 200 thousands keys turned out that the presented method for insertion processing is faster than original method, and deletion processing is equivalent to original method.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"27","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌データベース（TOD）"}],"bibliographicPageStart":"16","bibliographicIssueDates":{"bibliographicIssueDate":"2006-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG13(TOD31)","bibliographicVolumeNumber":"47"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}