{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00067300","sets":["1164:2592:5970:5971"]},"path":["5971"],"owner":"10","recid":"67300","title":["高頻度なフレーズの検索が高速な索引"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-01-19"},"_buckets":{"deposit":"b6e6b5dd-6d58-471e-b67f-35aecc62630a"},"_deposit":{"id":"67300","pid":{"type":"depid","value":"67300","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"高頻度なフレーズの検索が高速な索引","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"高頻度なフレーズの検索が高速な索引"},{"subitem_title":"Index with fast searching in case phrase is frequent","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2010-01-19","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学"},{"subitem_text_value":"九州大学"},{"subitem_text_value":"国立情報学研究所"},{"subitem_text_value":"九州大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Informatics","subitem_text_language":"en"},{"subitem_text_value":"Kyushu 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/67300/files/IPSJ-AL10128001.pdf"},"date":[{"dateType":"Available","dateValue":"2012-01-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL10128001.pdf","filesize":[{"value":"550.2 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"fce9cc18-1668-4f9a-b914-a9a90a8d3549","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2010 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"田中, 洋輔"},{"creatorName":"小野, 廣隆"},{"creatorName":"定兼, 邦彦"},{"creatorName":"山下, 雅史"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yosuke, Tanaka","creatorNameLang":"en"},{"creatorName":"Hirotaka, Ono","creatorNameLang":"en"},{"creatorName":"Kunihiko, Sadakane","creatorNameLang":"en"},{"creatorName":"Masafumi, Yamashita","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"大規模データに対する高速な文字列検索は接尾辞配列 (SA) を用いて実現できるが，SA には多くの容量が必要になってしまう．SA を圧縮する様々な方法が提案されているが，提案手法は，SA と転置インデックスを組み合わせることで，出現頻度の高いフレーズの検索が既存の索引に比べ高速な索引を実現する．最終的には実験により，以前提案した別手法5) と似た性能で，ある程度検索時間を調整可能であることを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"String pattern matching for large-scale data is efficiently achieved by suffix array (SA), but SA requires a large space. Therefore, various methods to compress SA have been proposed. In this paper, we combine SA and Inverted index. As a result, performance of the proposed method is better than existing ones when searching frequent phrases. Experiments show that the proposed method is similar to one which is proposed by us in other times, and able to control search time at some level.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2010-01-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2010-AL-128"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":67300,"updated":"2025-01-22T00:40:38.764948+00:00","links":{},"created":"2025-01-18T23:27:46.015689+00:00"}