{"id":9898,"updated":"2025-01-23T03:08:38.405715+00:00","links":{},"created":"2025-01-18T22:44:59.392393+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00009898","sets":["581:599:605"]},"path":["605"],"owner":"1","recid":"9898","title":["Ringed Bloom Filter による分散ハッシュテーブルのトラフィック量削減"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-07-15"},"_buckets":{"deposit":"ce020475-b9e6-4706-a052-3ce08483625c"},"_deposit":{"id":"9898","pid":{"type":"depid","value":"9898","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Ringed Bloom Filter による分散ハッシュテーブルのトラフィック量削減","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Ringed Bloom Filter による分散ハッシュテーブルのトラフィック量削減"},{"subitem_title":"Using Ringed Bloom Filters to Reduce the Communication Traffic on a Distributed Hash Table","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"特集：マルチメディア，分散，協調とモバイル（DICOMO2006）","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2007-07-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学"},{"subitem_text_value":"東京大学"},{"subitem_text_value":"東京大学 国立情報学研究所"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"The University of Tokyo,National Institute of Informatics","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/9898/files/IPSJ-JNL4807011.pdf"},"date":[{"dateType":"Available","dateValue":"2009-07-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4807011.pdf","filesize":[{"value":"777.3 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"05b682eb-8fa6-4dc1-b95b-4dc53f27540c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"清, 雄一"},{"creatorName":"松崎, 和賢"},{"creatorName":"本位田真一"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuichi, Sei","creatorNameLang":"en"},{"creatorName":"Kazutaka, Matsuzaki","creatorNameLang":"en"},{"creatorName":"Shinichi, Honiden","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","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_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Peer-to-Peer コンテンツ共有システムを実現する一手法として，分散ハッシュテーブル（DHT）がある．DHT を用いることで，存在するコンテンツを確実に発見することができるが，コンテンツの全文検索を行うにはスケーラビリティに欠ける．複数語によるAND 検索を行う際，コンテンツ数が多くなるとコンテンツID を送信するためのトラフィック量が大量に発生してしまうという問題があるからである．既存研究では，Bloom Filter という集合要素の圧縮手法を用いて，AND 検索時にコンテンツID を送信するための大量のトラフィック量を削減している．だがBloom Filter には欠点があり，トラフィック量の削減が十分ではない．本研究では，新たにRinged Bloom Filter を提案し，さらにトラフィック量を削減できることを示す．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A distributed hash table (DHT) technology realizes peer-to-peer contents sharing systems. A DHT system can find all files if the files are registered, but it lacks scalability at full text searching. In multi-word searching, there is so much communication traffic for transmission of file IDs. In related works, the authors reduced the amount of the communication traffic by using a bloom filter which is an ingenious randomized data-structure for concisely representing a set in order to support approximate membership queries. However, bloom filters have a limited role if several sets have different numbers of elements. Accordingly, we propose a “ringed bloom filter” to solve the problem of normal bloom filters.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2277","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2267","bibliographicIssueDates":{"bibliographicIssueDate":"2007-07-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"48"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"ミドルウェア"}]},"weko_creator_id":"1"}}