{"created":"2025-01-18T22:50:42.048965+00:00","updated":"2025-01-22T23:08:03.786627+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00017795","sets":["934:1022:1069:1073"]},"path":["1073"],"owner":"1","recid":"17795","title":["集合間の相違を明確にする要素辞書"],"pubdate":{"attribute_name":"公開日","attribute_value":"1999-02-15"},"_buckets":{"deposit":"eecd3e60-427e-45f1-b529-5f69bf3eb726"},"_deposit":{"id":"17795","pid":{"type":"depid","value":"17795","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"集合間の相違を明確にする要素辞書","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"集合間の相違を明確にする要素辞書"},{"subitem_title":"Element Dictionary to Specify Difference among Sets","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"研究論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"1999-02-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"八代工業高等専門学校情報電子工学科"},{"subitem_text_value":"佐賀大学理工学部知能情報システム学科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information and Electronics Engineering, Yatsushiro National College of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science, Faculty of Science and Engineering, Saga 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/17795/files/IPSJ-TOD4003007.pdf"},"date":[{"dateType":"Available","dateValue":"2001-02-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOD4003007.pdf","filesize":[{"value":"896.4 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":"13"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f08c394a-1c6d-475b-a216-91b2448068be","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1999 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"村田, 美友紀"},{"creatorName":"掛下, 哲郎"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Miyuki, Murata","creatorNameLang":"en"},{"creatorName":"Tetsuro, Kakeshita","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464847","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7799","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"集合検索はDBにおける重要なトピックであり  キーワードを用いた文献検索や仕様に基づいたソフトウエア検索等の分野に応用できる. 本論文では集合検索を効果的に行うために要素辞書の概念を定義し  要素辞書の構成アルゴリズムを提案する. 要素辞書を用いることで 以下の特徴が得られる. (l)検索対象集合を特定する検索条件が常に構成できる. (2)任意の集合間の相違に関する質問に答えられる. (3)要素辞書を最適化することで索引のサイズを最小化できる. 互いに異なるn個の集合に対して要素辞書のサイズはlog n以上である. 最小の要素辞書構成問題はNP完全になるが  与えられたn個の集合に対してサイズが高々n-1の要素辞書が多項式時間で構成できる. さらに  検索対象集合の追加削除に伴って要素辞書を多項式時間で再構成するアルゴリズムを提案する.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Set retrieval is an important topic in databases and has many application domains such as document retrieval using keywords and software retrieval based on their specification. In this paper, we define the notion of element dictionary to effectively retrieve sets and propose construction algorithms for the dictionary. The following advantages can be obtained by using the element dictionary. (1) A retrieval condition can always be constructed to identify the target set. (2) Difference among sets can always be specified. (3) Index size can be minized by optimizing the dictionary. The size of an element dictionary is at least log n for n distinct sets. Although the construction of the minimum element dictionary is NP complete, a dictionary of at most n-1 elements can be constructed in polynomial time. Furthermore we propose polynomial time algorithms to reconstruct the element dictionary when a target set is added to or deleted from the database.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"67","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌データベース（TOD）"}],"bibliographicPageStart":"60","bibliographicIssueDates":{"bibliographicIssueDate":"1999-02-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG03(TOD1)","bibliographicVolumeNumber":"40"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":17795,"links":{}}