{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00160381","sets":["581:8417:8709"]},"path":["8709"],"owner":"11","recid":"160381","title":["XPath充足可能性を判定する多項式時間アルゴリズムの提案と評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-05-15"},"_buckets":{"deposit":"c96c2e4a-3ff1-47cb-ac9a-23cded96cc41"},"_deposit":{"id":"160381","pid":{"type":"depid","value":"160381","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"XPath充足可能性を判定する多項式時間アルゴリズムの提案と評価","author_link":["310249","310248","310247","310244","310245","310246"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"XPath充足可能性を判定する多項式時間アルゴリズムの提案と評価"},{"subitem_title":"Proposal and Evaluation of Polynomial-time Algorithms for Deciding XPath Satisfiability","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[一般論文（推薦論文）] 問合せ解析，充足可能性，XPath，XMLデータベース","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2016-05-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学"},{"subitem_text_value":"大阪大学"},{"subitem_text_value":"大阪大学"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/160381/files/IPSJ-JNL5705018.pdf","label":"IPSJ-JNL5705018.pdf"},"date":[{"dateType":"Available","dateValue":"2018-05-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5705018.pdf","filesize":[{"value":"636.0 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"53be0f35-7d03-4bdb-a31e-1b3b629cadfa","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"杉村, 憲司"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"石原, 靖哲"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"藤原, 融"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kenji, Sugimura","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yasunori, Ishihara","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toru, Fujiwara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","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_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"XPath充足可能性判定問題は，問合せの最適化などに応用できる重要な問題であるが，一般にはNP困難であることが知られている．そのため，DTDやXPath式のクラスを制限することで，多項式時間で充足可能性を判定できるアルゴリズムを提案する研究が行われている．本論文では，多項式時間充足可能性判定アルゴリズムを提案・実装し，その有用性を評価する．実装の結果，一般的なベンチマークに対して数十ミリ秒で判定でき，SATソルバを用いた手法に比べて十分に高速であることが分かった．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"XPath satisfiability is an important problem that is useful for query optimization, but it is known to be NP-hard in general. Therefore, some researches propose polynomial-time algorithms for deciding XPath satisfiability for some restricted classes of DTDs and XPath expressions. In this paper, we propose and implement polynomial-time algorithms for XPath satisfiability, and discuss their usefulness. The satisfiability of a standard benchmark can be decided in several tens of milliseconds; it is much faster than the methods based on SAT solvers.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1488","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1477","bibliographicIssueDates":{"bibliographicIssueDate":"2016-05-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"57"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":160381,"updated":"2025-01-20T12:20:21.044083+00:00","links":{},"created":"2025-01-19T00:33:18.030460+00:00"}