{"updated":"2025-01-21T20:09:46.875966+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00079662","sets":["934:1022:6385:6638"]},"path":["6638"],"owner":"11","recid":"79662","title":["タプル再分散不要の並列データベース構成法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-12-28"},"_buckets":{"deposit":"1fa85a58-b686-439c-9099-239a18f1a05f"},"_deposit":{"id":"79662","pid":{"type":"depid","value":"79662","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"タプル再分散不要の並列データベース構成法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"タプル再分散不要の並列データベース構成法"},{"subitem_title":"A Parallel Database Architecture Avoiding Tuple Redistribution","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"研究論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2011-12-28","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":"Information Technology Research Institute, National Institute of Advanced Industrial Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Information Technology Research Institute, National Institute of Advanced Industrial Science and Technology","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/79662/files/IPSJ-TOD0404003.pdf"},"date":[{"dateType":"Available","dateValue":"2013-12-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOD0404003.pdf","filesize":[{"value":"7.4 MB"}],"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":"71c1cd61-82f6-47f8-ad7f-777b33ba0f34","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 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":"Makoto, Yui","creatorNameLang":"en"},{"creatorName":"Isao, Kojima","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":"本論文では無共有計算機設計においてデータウェアハウス処理を行ううえでタプルの再分散の問題に着目し，タプルの再分散を必要としない並列データベース構成法を述べる．特にΦハッシュ分割と呼ぶ，タプルの再分散を必要としないテーブル分割手法を提案する．Φハッシュ分割ではノード数に対するスケーラビリティを維持しながら，TPC-Hなどの複雑なデータ分析問合せを並列処理することができる．TPC-HのSF=100による評価実験で，提案手法がMapReduceに基づく競合システムHiveに対して顕著な性能面での優越（3.1倍～19.9倍）があることを示すとともに，我々の問合せ処理手法の現実装における有効範囲と制限に考察を与える．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper describes a parallel database architecture avoiding tuple redistribution. We focus on the tuple redistribution issue; it becomes problematic on processing data warehouse queries on a shared-nothing architecture. And then, we propose a novel table partitioning technique, named Φ hash partitioning, that can avoid redistribution of tuples. The Φ hash partitioning can handle complex analytical queries, as ones in TPC-H, in parallel. Moreover, the partitioning scheme does not have a scalability limit on the number of nodes. The results of experimental evaluation showed that our system is much (3.1 to 19.9 times) faster than a MapReduce-based system (Hive) on TPC-H SF=100. We also give a consideration on the capabilities and limitations of the current implementation of our query processing scheme.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"33","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌データベース（TOD）"}],"bibliographicPageStart":"11","bibliographicIssueDates":{"bibliographicIssueDate":"2011-12-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"4"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:34:18.842954+00:00","id":79662,"links":{}}