{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00199058","sets":["6164:6165:8377:9886"]},"path":["9886"],"owner":"44499","recid":"199058","title":["Shape Expression Schemaの下でのパターン問合せ充足可能性判定アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-09-01"},"_buckets":{"deposit":"297531a1-259b-41ba-8c0b-f26fa74204a8"},"_deposit":{"id":"199058","pid":{"type":"depid","value":"199058","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Shape Expression Schemaの下でのパターン問合せ充足可能性判定アルゴリズム","author_link":["481366","481367"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Shape Expression Schemaの下でのパターン問合せ充足可能性判定アルゴリズム"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"データベース技術","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2019-09-01","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"筑波大学"},{"subitem_text_value":"筑波大学"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tsukuba Univ.","subitem_text_language":"en"},{"subitem_text_value":"Tsukuba Univ.","subitem_text_language":"en"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":44499,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/199058/files/IPSJ-WebDBF2019013.pdf","label":"IPSJ-WebDBF2019013.pdf"},"date":[{"dateType":"Available","dateValue":"2021-09-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-WebDBF2019013.pdf","filesize":[{"value":"1.3 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"330","billingrole":"5"},{"tax":["include_tax"],"price":"0","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":"549e53a0-052b-4ccd-9288-26e5ba14a730","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"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_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Shape Expression Schema (ShEx) はグラフデータのスキーマを記述するために新たに提案されたスキーマ言語である．パターン問合せ P と ShEx スキーマ S に対して，S に妥当などのグラフデータにおいても P の解が空であるとき，P は充足不能であるという．一般にグラフデータのサイズは非常に大きく，充足不能なパターン問合せの実行は明らかに無駄である．そのため，充足不能なパターンを ShEx の定義から発見できることが望ましい．そこで本稿では，パターン問合せが ShEx スキーマの下で充足不能であるか否かを判定するアルゴリズムを提案する．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"52","bibliographic_titles":[{"bibliographic_title":"WebDB Forum 2019論文集"}],"bibliographicPageStart":"49","bibliographicIssueDates":{"bibliographicIssueDate":"2019-09-01","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2019"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":199058,"updated":"2025-01-19T21:48:04.722217+00:00","links":{},"created":"2025-01-19T01:03:10.704665+00:00"}