{"created":"2025-01-19T01:29:06.415983+00:00","updated":"2025-01-19T11:25:57.707957+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00229755","sets":["6504:11436:11439"]},"path":["11439"],"owner":"44499","recid":"229755","title":["データストリームに対する効率的な複数連続的集約アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-02-16"},"_buckets":{"deposit":"3a01250a-d430-42ba-815e-3ca994400aae"},"_deposit":{"id":"229755","pid":{"type":"depid","value":"229755","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"データストリームに対する効率的な複数連続的集約アルゴリズム","author_link":["618028","618027","618029"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"データストリームに対する効率的な複数連続的集約アルゴリズム"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"データとウェブ","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2023-02-16","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"筑波大"},{"subitem_text_value":"筑波大"},{"subitem_text_value":"筑波大"}]},"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/229755/files/IPSJ-Z85-1N-06.pdf","label":"IPSJ-Z85-1N-06.pdf"},"date":[{"dateType":"Available","dateValue":"2023-11-17"}],"format":"application/pdf","filename":"IPSJ-Z85-1N-06.pdf","filesize":[{"value":"560.8 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"f27a6f07-71f4-4644-a7c5-e7cc062672d9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"川上, 隼"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Bou, Savong"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"天笠, 俊之"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ストリームの収集・解析の需要が高くなり、ストリーム処理システムは多くの設計上の課題に直面している。その一つに集中的な計算を伴う連続的なウィンドウ集約の実行がある。集約クエリの数が多い場合、システムはスケーラビリティの問題に悩まされる。クエリは通常類似しており、ウィンドウの仕様が異なるだけである。本論文では、共有による複数クエリの集約の効率化を提案する。複数クエリの中で最長と最短のウィンドウサイズをもとに作成する二つの配列のみで集約を行い、その結果を全てのクエリで共有することで、インクリメンタルな方法で効率的な計算を行うことができる。実験評価の結果、提案アルゴリズムは最新の手法であるMCQAと比べて、最大５倍高速化できることがわかった。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"460","bibliographic_titles":[{"bibliographic_title":"第85回全国大会講演論文集"}],"bibliographicPageStart":"459","bibliographicIssueDates":{"bibliographicIssueDate":"2023-02-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2023"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":229755,"links":{}}