{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214560","sets":["1164:1165:10664:10758"]},"path":["10758"],"owner":"44499","recid":"214560","title":["木分解の圧縮および解集合プログラミングによる問合せ"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-12-20"},"_buckets":{"deposit":"9b5b9046-f7db-4f92-9ec3-2dc8289a54ad"},"_deposit":{"id":"214560","pid":{"type":"depid","value":"214560","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"木分解の圧縮および解集合プログラミングによる問合せ","author_link":["551482","551480","551481","551479"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"木分解の圧縮および解集合プログラミングによる問合せ"},{"subitem_title":"Tree Decomposition Compression Using Tree Grammar and Query Processing Based on Answer Set Programming","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"テキスト処理","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2021-12-20","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":"Graduate School of Informatics, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Nagoya 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/214560/files/IPSJ-DBS21174003.pdf","label":"IPSJ-DBS21174003.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS21174003.pdf","filesize":[{"value":"925.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"13"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"7e424844-509c-4e8c-b02a-c4eae6a02285","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小島, 和之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"関, 浩之"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuyuki, Kojima","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroyuki, Seki","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-871X","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"グラフの木分解は，グラフデータへの問合せ処理に対する有効なアプローチであるが，木分解自体に大きな計算量を要することが多い．筆者らはこれまで木分解結果を圧縮し直接問合せを行う手法を提案した．しかしこの手法は個々の問題ごとに圧縮データを前提としてアルゴリズムを記述しなければならないという問題があった．そこで本研究では，問合せ処理に解集合プログラミングを利用し，圧縮データ構造を意識せずに記述したアルゴリズムを，圧縮データを操作するプログラムに変換する手法を提案した．さらに提案手法に基づく問合せ実行ツールを Clingo と C++ によって実装した．本稿では提案手法を説明した後，最大独立集合問題，3 彩色問題に対する問合せアルゴリズムを解集合プログラミングで記述した実験結果を示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Tree decomposition of a graph is an effective approach to solving problems for large graphs while the decomposition itself needs much time in general. In the previous work, we proposed a method of compressing a decomposed tree and directly manipulating the compressed data. However, a query must be manually written assuming a compressed data. In this paper, we propose a query processing method based on answer set programming. A user can write a query in a declarative way without assuming a compressed data and the query can be translated into a program that directly manipulates a compressed data. The paper shows the experimental results conducted in our  prototype system implemented by Clingo and C++.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-12-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2021-DBS-174"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214560,"updated":"2025-01-19T16:34:39.728918+00:00","links":{},"created":"2025-01-19T01:15:22.312438+00:00"}