{"id":214782,"updated":"2025-01-19T16:28:13.999594+00:00","links":{},"created":"2025-01-19T01:15:34.812895+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214782","sets":["6504:10735:10806"]},"path":["10806"],"owner":"44499","recid":"214782","title":["頻出部分クエリの近傍探索により削減した解の部分空間での実体化ビュー選択の最適化によるクエリ処理の高速化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-04"},"_buckets":{"deposit":"aa4965af-c21a-4dab-a9c0-083dd0779312"},"_deposit":{"id":"214782","pid":{"type":"depid","value":"214782","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"頻出部分クエリの近傍探索により削減した解の部分空間での実体化ビュー選択の最適化によるクエリ処理の高速化","author_link":["552185","552186","552187"],"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":"2021-03-04","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/214782/files/IPSJ-Z83-4L-03.pdf","label":"IPSJ-Z83-4L-03.pdf"},"date":[{"dateType":"Available","dateValue":"2021-12-28"}],"format":"application/pdf","filename":"IPSJ-Z83-4L-03.pdf","filesize":[{"value":"292.1 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"87be63db-f3da-4f61-916e-902f33c05c95","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"乗松, 奨真"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鬼塚, 真"}],"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":"データベースにおける分析を高速に行うために高速なクエリの処理が不可欠である。データベース上では重複した処理が実行されることが多く、クエリ処理の実行結果を実体化することはデータベース全体での処理の高速化に繋がる。ここで実行結果を実体化するクエリの選択が重要となるが、実体化するクエリの選択を単純に整数計画問題で解くことは解の探索空間が膨大であるため困難である。本稿では、解空間の部分空間において整数計画問題によって局所的に最適解を探索し、得られた最適解の近傍に探索範囲を拡大することで解を改善する処理を繰り返すことで実体化するクエリを決定する。この手法により既存手法と比較して、高速な処理を期待する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"352","bibliographic_titles":[{"bibliographic_title":"第83回全国大会講演論文集"}],"bibliographicPageStart":"351","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2021"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}