{"created":"2025-01-18T22:51:41.643886+00:00","updated":"2025-01-22T22:22:37.467930+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00019150","sets":["1164:1165:1179:1183"]},"path":["1183"],"owner":"1","recid":"19150","title":["拡張チャンクによる多次元配列の圧縮格納方式"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-01-21"},"_buckets":{"deposit":"098c2fb2-6321-4836-895d-6aed34ff1bdf"},"_deposit":{"id":"19150","pid":{"type":"depid","value":"19150","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":"A Compression Scheme for Multidimensional Arrays Using Extended Chunks","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2005-01-21","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":"Graduate School of Engineering., Fukui University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering., Fukui University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering., Fukui University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering., Fukui 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/19150/files/IPSJ-DBS04135014.pdf"},"date":[{"dateType":"Available","dateValue":"2007-01-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS04135014.pdf","filesize":[{"value":"167.1 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":"44"}],"accessrole":"open_date","version_id":"631efecb-fc21-4338-adbc-e6fe16948bea","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 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":"Kohei, KATADA","creatorNameLang":"en"},{"creatorName":"TERIGELE","creatorNameLang":"en"},{"creatorName":"Tatsuo, TSUJI","creatorNameLang":"en"},{"creatorName":"Ken, HIGUCHI","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112482","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":"MOLAPにおいて使用される多次元配列は，一般に(1)疎配列となる，(2)配列要素の逐次検索速度が検索する配列次元に依存する，という問題点がある．(2)は多次元配列の要素をあらかじめ決められた次元順に線形に二次記憶領域に配置するときには不可避な問題である．MOLAPシステムにおいて，多次元配列を二次記憶に格納する上でよく使われる手法としてchunkと呼ばれる一様な大きさに配列全体を分割して配置する手法がある． (1)の問題を解決するためにchunkの圧縮を行うとき，chunkコンテナと呼ぶディスクページに複数の圧縮chunkを詰め合わせる．我々は以前，この詰め合わせアルゴリズムを提案して，評価した．ここでは，拡張chunk の考え方を提案してchunkの充填率が極端に低い状況にも対応できるコンテナ化アルゴリズムを提案して，シミュレーションにより評価する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The implementation of multidimensional arrays used in MOLAP suffers from the problems; (1) the number of nonempty elements tends to be so small, (2) the time consumed in sequential access to array elements heavily depends on the dimension along which the elements are accessed.  The second problem is inevitable in allocating a multidimensional array according to the predefined order of dimensions.   In MOLAP, the whole  multidimensional array　is　often partitioned into subarrays called chunks and stored in the secondary storage. In order to resolve the first problem, theses chunks are compressed and packed in a disk page called a chunk container.  We have already proposed several chunk containerization algorithms and evaluated them.  In this paper, by introducing the notion of the extended chunk, a new chunk containerization scheme is presented for against the situation where the filling up ratio of the chunks is extremely low, and the scheme is evaluated by simulation.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"102","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"95","bibliographicIssueDates":{"bibliographicIssueDate":"2005-01-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6(2004-DBS-135)","bibliographicVolumeNumber":"2005"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":19150,"links":{}}