{"updated":"2025-01-21T18:40:14.207825+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00083229","sets":["1164:3500:6656:6837"]},"path":["6837"],"owner":"11","recid":"83229","title":["正規木文法間の差分抽出アルゴリズムの提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-07-25"},"_buckets":{"deposit":"53f8ed06-46ab-4348-8067-fa9b9ca5a941"},"_deposit":{"id":"83229","pid":{"type":"depid","value":"83229","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"正規木文法間の差分抽出アルゴリズムの提案","author_link":["0"],"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":"4","publish_date":"2012-07-25","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 Library, Information and Media Studies, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Library, Information and Media Studies, University of Tsukuba","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/83229/files/IPSJ-IFAT12107012.pdf"},"date":[{"dateType":"Available","dateValue":"2014-07-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IFAT12107012.pdf","filesize":[{"value":"1.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"0d8159d5-4c81-44f7-b5bd-d267745d6e54","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"堀江和磨"},{"creatorName":"鈴木伸崇"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10114171","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"XML は Web 上の標準的なデータ記述フォーマットとして広く普及している．XML データをデータベース等で継続的に蓄積・管理する場合，格納すべきデータの構造をスキーマで定義しておき，それに沿った構造のデータを作成・格納することが一般的である．利用状況の変化により格納すべきデータの構造や種類が変化するため，それに応じてスキーマ定義も更新されることが多い．その場合，スキーマの更新履歴の管理やスキーマの更新に応じた XML データの修正等が必要となるため，スキーマ間の差分抽出アルゴリズムが有用である．そこで本稿では，正規木文法のための差分抽出問題について考察し，同問題が計算困難であること，および，同問題が効率良く解けるための十分条件を示す．また，その十分条件の下で動作する多項式アルゴリズムを求め，このアルゴリズムに関する評価実験を行う．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告情報基礎とアクセス技術（IFAT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2012-07-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12","bibliographicVolumeNumber":"2012-IFAT-107"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:36:48.188107+00:00","id":83229,"links":{}}