{"updated":"2025-01-22T01:17:20.902862+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00065880","sets":["1:5760:5860"]},"path":["5860"],"owner":"10","recid":"65880","title":["大規模データ処理のための簡潔データ構造"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-08-15"},"_buckets":{"deposit":"28f0f911-6b4d-4980-9eab-973659566007"},"_deposit":{"id":"65880","pid":{"type":"depid","value":"65880","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":"Succinct Data Structures for Large-Scale Data Processing","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"解説","subitem_subject_scheme":"Other"}]},"item_type_id":"1","publish_date":"2007-08-15","item_1_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学大学院システム情報科学研究院"}]},"item_1_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyushu Univ.","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/65880/files/IPSJ-MGN480815.pdf"},"date":[{"dateType":"Available","dateValue":"2009-08-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MGN480815.pdf","filesize":[{"value":"494.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"6251ac0a-9e4a-4c7f-a1cd-f0678e2cc28a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 by the Information Processing Society of Japan"}]},"item_1_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"定兼, 邦彦"}],"nameIdentifiers":[{}]}]},"item_1_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kunihiko, SADAKANE","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_1_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116625","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"article"}]},"item_1_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"データ列に対して検索効率などを効率化するため，索引を付加することがある．演算を効率化するために，データに対して特定の情報を付加したものを，ここではデータ構造と呼ぶこととする．本稿ではこのようなデータ構造のうち，もとのデータの長さnに対してo(n)程度の付加情報のみを与える，簡潔データ構造と呼ばれる分野について解説する．特に，最も基本的かつ応用範囲の広いビットベクトルに関する簡潔データ構造に焦点を当てる．ビットベクトルBに対して，先頭からi番目までのビット中の1の数を与えるrank1(B  i)と，i番目の1の位置を与える select1(B  i)という演算は，基本的かつ重要な演算である．これらの演算が定数時間で可能な簡潔データ構造について，具体的なデータ構造とアルゴリズムを紹介し，次に付加するデータサイズの下界についての結果を示し，最後に今後の展望について述べる．","subitem_description_type":"Other"}]},"item_1_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"902","bibliographic_titles":[{"bibliographic_title":"情報処理"}],"bibliographicPageStart":"899","bibliographicIssueDates":{"bibliographicIssueDate":"2007-08-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"48"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:26:51.770617+00:00","id":65880,"links":{}}