{"created":"2025-01-18T23:01:38.451866+00:00","updated":"2025-01-22T16:06:34.580146+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032589","sets":["1164:2592:2707:2710"]},"path":["2710"],"owner":"1","recid":"32589","title":["推移的閉包計算のための再分割を伴わない列ブロック分割法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1991-07-22"},"_buckets":{"deposit":"8f9372c8-9f21-437d-acc3-bc97d886cd9f"},"_deposit":{"id":"32589","pid":{"type":"depid","value":"32589","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":"Non-repartitioning Blocked Column Transitive Closure Algorithm","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1991-07-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北海道大学工学部"},{"subitem_text_value":"北海道大学工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering, Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, Hokkaido 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/32589/files/IPSJ-AL91022008.pdf"},"date":[{"dateType":"Available","dateValue":"1993-07-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL91022008.pdf","filesize":[{"value":"885.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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"2a617860-39e0-4625-a907-b6a5254986a6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1991 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"大柳, 俊夫"},{"creatorName":"大内, 東"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Toshio, Ohyanagi","creatorNameLang":"en"},{"creatorName":"Azuma, Ohuchi","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":"二次記憶装置とのデータI/Oを伴いながら推移的閉包計算を行うことは，大規模な関係データベースにおける再帰質問処理などで必要となる重要なことである．このような二次記憶環境下で推移的閉包計算を効率よく行う方法として，列ブロック分割法および行ブロック分割法が，Agrawalらにより提案されている．彼等の方法は，I/Oをできる限り行わないための動的なブロック分割の決定およびブロックの再分割方法に特徴がある．本論文では，Agrawalらの列ブロック分割法における列分割方法を変更し，ブロックの再分割を完全に避けることが可能な，再分割を伴わない列ブロック分割法を提案する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A new transitive closure algorithm, called non-repartitioning blocked column algorithm, is proposed. It was Obtained by modifying the column partitioning method of blocked column algorithm proposed by Agrawal et al. The new algoritm excludes a possibility of dynamic column repartitioning which is an essential feature of blocked column algorithm. A detailed comparison of the total number of I/O and the total amount of I/O of both algorithms is made. The result reveals that the proposed algorithm has better I/O features than that of blocked column algorithm.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"1991-07-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"69(1991-AL-022)","bibliographicVolumeNumber":"1991"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32589,"links":{}}