{"created":"2025-01-18T23:35:50.303995+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00081782","sets":["581:6644:6761"]},"path":["6761"],"owner":"11","recid":"81782","title":["A Tag-Based Scheme to Realize Real-Time File Search in Hierarchical Peer-to-Peer Systems"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-04-15"},"_buckets":{"deposit":"95a7e9d8-682b-4d21-987a-16177cf9a4ef"},"_deposit":{"id":"81782","pid":{"type":"depid","value":"81782","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"A Tag-Based Scheme to Realize Real-Time File Search in Hierarchical Peer-to-Peer Systems","author_link":["357832","357835","357834","357836","357831","357833","357829","357830"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Tag-Based Scheme to Realize Real-Time File Search in Hierarchical Peer-to-Peer Systems"},{"subitem_title":"A Tag-Based Scheme to Realize Real-Time File Search in Hierarchical Peer-to-Peer Systems","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"一般論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2012-04-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"The authors are with the Department of Information Engineering, Hiroshima University"},{"subitem_text_value":"The authors are with the Department of Information Engineering, Hiroshima University"},{"subitem_text_value":"The authors are with the Department of Information Engineering, Hiroshima University"},{"subitem_text_value":"The authors are with the Department of Information Engineering, Hiroshima University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"The authors are with the Department of Information Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"The authors are with the Department of Information Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"The authors are with the Department of Information Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"The authors are with the Department of Information Engineering, Hiroshima University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/81782/files/IPSJ-JNL5304024.pdf","label":"IPSJ-JNL5304024"},"date":[{"dateType":"Available","dateValue":"2014-04-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5304024.pdf","filesize":[{"value":"695.5 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":"12f6e0e1-82a9-4b6b-aca3-84c171b57768","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"TingTingQin"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Qi, Cao"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"QiYingWei"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Satoshi, Fujita"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ting, Qin","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Qi, Cao","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Qi, YingWei","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Satoshi, Fujita","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":"In this paper, we propose a new method to realize quick update of information concerned with shared contents in Peer-to-Peer (P2P) networks. The proposed method is a combination of a hierarchical P2P architecture and a tag-based file management scheme. The hierarchical architecture consists of three layers: the top layer consisting of a collection of central servers, the middle layer consisting of a set of sub-servers, and the bottom layer consisting of a number of user peers. Indexes of files held by each user peer are stored at the sub-servers in the middle layer, and the correlation between file indexes and sub-servers is maintained by central servers using tags. We implemented a prototype of the proposed method using Java, and evaluated the performance through simulations using PeerSim 1.0.4. The results of our experiments indicate that the proposed method is a good candidate for “real-time search engines” in P2P systems; e.g., it completes an upload of 10,000 file indexes to the relevant sub-servers in a few minutes and achieves query forwarding to relevant peers within 100ms.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.463\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose a new method to realize quick update of information concerned with shared contents in Peer-to-Peer (P2P) networks. The proposed method is a combination of a hierarchical P2P architecture and a tag-based file management scheme. The hierarchical architecture consists of three layers: the top layer consisting of a collection of central servers, the middle layer consisting of a set of sub-servers, and the bottom layer consisting of a number of user peers. Indexes of files held by each user peer are stored at the sub-servers in the middle layer, and the correlation between file indexes and sub-servers is maintained by central servers using tags. We implemented a prototype of the proposed method using Java, and evaluated the performance through simulations using PeerSim 1.0.4. The results of our experiments indicate that the proposed method is a good candidate for “real-time search engines” in P2P systems; e.g., it completes an upload of 10,000 file indexes to the relevant sub-servers in a few minutes and achieves query forwarding to relevant peers within 100ms.\n\n------------------------------ \nThis is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.20(2012) No.2 (online) \nDOI　http://dx.doi.org/10.2197/ipsjjip.20.463\n------------------------------ \n","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2012-04-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"53"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":81782,"updated":"2025-01-20T06:51:48.630369+00:00","links":{}}