{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00020254","sets":["1164:1165:1223:1228"]},"path":["1228"],"owner":"1","recid":"20254","title":["拡張可能類名表記を用いた類似キー検索ファイル"],"pubdate":{"attribute_name":"公開日","attribute_value":"1995-01-26"},"_buckets":{"deposit":"eab389af-9f57-440f-97c1-52a3334494d4"},"_deposit":{"id":"20254","pid":{"type":"depid","value":"20254","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":"A SIMILAR KEY SEARCH FILE USING EXTENDIBLE CLASS NAME EXPRESSION","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1995-01-26","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"日本IBM"},{"subitem_text_value":"神戸大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"IBM Japan","subitem_text_language":"en"},{"subitem_text_value":"Kobe 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/20254/files/IPSJ-DBS94101010.pdf"},"date":[{"dateType":"Available","dateValue":"1997-01-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS94101010.pdf","filesize":[{"value":"1.0 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":"13"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"28cd8a57-88af-44f1-9200-aff59f397c9a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1995 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_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Motoichi, Hirade","creatorNameLang":"en"},{"creatorName":"Eiichi, Tanaka","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本文は拡張可能類名表記とB^+?木を用いて類似キーの検索ができるファイルの一構成法について書いている。拡張類名表記を用いると、従来の類名表記を用いたときに比べて、1つの類名表記に属するキーの数の分散が少なくなり、記憶利用率が良くなる。230，188個のキーで実験したところ、記憶利用率は約66%であった。長さ6の入力キーのとき、類似キー検索時のページ読み込み回数は約30．2回であった。紙数の都合で理論的検討の記述は省略したが、実験値は理論値とよく一致した。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In information retrieval there is a great demand for a file that can retrieve similar keys to an input key. However, only a few researches have been done for this kind of files. This paper proposes a file of this kind using extendible class name expressions and based on a B^+-tree. Therefore, the file can easily insert and delete keys without lowering its storage utilization. The experiment using 230,188 keys with length 1 縲鰀 16 shows the good performance of the file. That is, the file can retrieve, insert and delete keys with less disk access than an original B-tree. The number of page reads for searching similar keys is around 30.2 in case of an input key with length 6. The storage utilization of the file is about 66%. This value is very close to the average storage utilization of an original B-tree. The performance of this files is analyzed and the theoretical evaluation shows a good coincidence to the experimental value.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"80","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"73","bibliographicIssueDates":{"bibliographicIssueDate":"1995-01-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12(1994-DBS-101)","bibliographicVolumeNumber":"1995"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":20254,"updated":"2025-01-22T21:49:59.711309+00:00","links":{},"created":"2025-01-18T22:52:30.284444+00:00"}