{"created":"2025-01-18T23:22:41.212946+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00060040","sets":["5471:5545:5549"]},"path":["5549"],"owner":"11","recid":"60040","title":["Analysis of Parallel Hashing Algorithms with Key Deletion"],"pubdate":{"attribute_name":"公開日","attribute_value":"1978-04-20"},"_buckets":{"deposit":"012bc05e-d2ab-4f0b-9570-70a88c5327c9"},"_deposit":{"id":"60040","pid":{"type":"depid","value":"60040","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Analysis of Parallel Hashing Algorithms with Key Deletion","author_link":["361202","361201","361203","361200"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Analysis of Parallel Hashing Algorithms with Key Deletion"},{"subitem_title":"Analysis of Parallel Hashing Algorithms with Key Deletion","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"(IPSJ Best Paper Award、論文賞受賞)","subitem_subject_scheme":"Other"}]},"item_type_id":"5","publish_date":"1978-04-20","item_5_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Institute of Physical and Chemical Research 2-1"},{"subitem_text_value":"Department of Information Science University of Tokyo"}]},"item_5_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Institute of Physical and Chemical Research 2-1","subitem_text_language":"en"},{"subitem_text_value":"Institute of Physical and Chemical Research 2-1/Department of Information Science University of Tokyo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/60040/files/IPSJ-JIP0101005.pdf","label":"IPSJ-JIP0101005"},"date":[{"dateType":"Available","dateValue":"1980-04-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JIP0101005.pdf","filesize":[{"value":"953.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"3e1f3841-0212-47c7-9233-62d2bd9c1979","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1978 by the Information Processing Society of Japan"}]},"item_5_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tetsuo, Ida"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Eiichi, Goto"}],"nameIdentifiers":[{}]}]},"item_5_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tetsuo, Ida","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Eiichi, Goto","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_5_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA00700121","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_5_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-6652","subitem_source_identifier_type":"ISSN"}]},"item_5_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Three parallel hashing schemes are presented together with the analysis of their efficiencies based on a statistical theory. As assesment parameters  probe numbers for parallel hash algorithms in these schemes such as for pure search and for key insertion are calculated in the worst statistical equilibrium. The results show improvement of the efficiencies of parallel hash algorithms over those of conventional sequential hashing. When parallel hash algorithms are implemented in hardware with multi-bank memory  they can be executed in a time comparable to single indirect addressing.","subitem_description_type":"Other"}]},"item_5_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Three parallel hashing schemes are presented together with the analysis of their efficiencies based on a statistical theory. As assesment parameters, probe numbers for parallel hash algorithms in these schemes such as for pure search and for key insertion are calculated in the worst statistical equilibrium. The results show improvement of the efficiencies of parallel hash algorithms over those of conventional sequential hashing. When parallel hash algorithms are implemented in hardware with multi-bank memory, they can be executed in a time comparable to single indirect addressing.","subitem_description_type":"Other"}]},"item_5_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"32","bibliographic_titles":[{"bibliographic_title":"Journal of Information Processing "}],"bibliographicPageStart":"25","bibliographicIssueDates":{"bibliographicIssueDate":"1978-04-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"1"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":60040,"updated":"2025-01-20T06:34:29.802407+00:00","links":{}}