{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00017372","sets":["934:1022:1023:1024"]},"path":["1024"],"owner":"1","recid":"17372","title":["P2P情報検索における単語の頻度情報に基づくデータ配置手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-12-26"},"_buckets":{"deposit":"c12e97fa-d96c-4fb5-b2be-8a7f9f85ef1c"},"_deposit":{"id":"17372","pid":{"type":"depid","value":"17372","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"P2P情報検索における単語の頻度情報に基づくデータ配置手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"P2P情報検索における単語の頻度情報に基づくデータ配置手法"},{"subitem_title":"Data Allocation Scheme Based on Term Frequency for P2P Information Retrieval","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"研究論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2008-12-26","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学"},{"subitem_text_value":"東京大学 現在，東芝研究開発センター"},{"subitem_text_value":"国立情報学研究所"},{"subitem_text_value":"国立情報学研究所"}]},"item_3_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,Presently with Corporate Research & Development Center, Toshiba Corporation","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Informatics","subitem_text_language":"en"},{"subitem_text_value":"National Institute of Informatics","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/17372/files/IPSJ-TOD0103002.pdf"},"date":[{"dateType":"Available","dateValue":"2010-12-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOD0103002.pdf","filesize":[{"value":"1.3 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":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"8bfb36ba-315e-4370-b5af-b553a29c4b6a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"倉沢, 央"},{"creatorName":"若木, 裕美"},{"creatorName":"高須, 淳宏"},{"creatorName":"安達, 淳"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hisashi, Kurasawa","creatorNameLang":"en"},{"creatorName":"Hiromi, Wakaki","creatorNameLang":"en"},{"creatorName":"Atsuhiro, Takasu","creatorNameLang":"en"},{"creatorName":"Jun, Adachi","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":"Peer-to-Peer（P2P）ネットワークを用いた情報検索（IR）では，低コストでありながら負荷分散や高いスケーラビリティが簡単に実現可能である．しかし既存のP2Pネットワークを用いた情報検索手法のデータ配置法の多くは個々の文書のデータは内容に無関係に配置されているため，ユーザは問合せに対する適合度の大小にかかわらず同じだけの手間をかけて文書を取得しなければならない．そこで我々はP2P IRにおける検索実行時のコストを削減するためのデータ配置法，Concordiaを提案する．Concordiaは文書データの配置場所を，検索時に索引参照のために接続するノードと関連づけ，文書における重みの大きな単語の索引を管理するノードに文書データを配置する．文書のデータを単語の重みに基づいて配置することで，クエリとの適合度の高いファイルほど収集を容易にする手法である．この提案手法の効果を評価するため，処理効率を重視した単純複製配置法とノードの頻繁な離脱に対応可能な符号化複製配置法を提案し，性能を実験的に検証した．その結果，適合文書収集時に参照するノード数を削減した高い収集効率を確認した．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In order to overcome disadvantages of centralized search systems, Peer-to-Peer information retrieval (P2P IR) systems are considered a scalable and costeffective approach with load balancing capability. Many Peer-to-Peer information retrieval systems that use a global index have already been proposed that can retrieve documents relevant to a query. Since documents are allocated to peers regardless of the query, the system needs to connect many peers to gather the relevant documents. We propose a new data allocation scheme for P2P information retrieval that we call Concordia. Concordia uses a node to allocate a document based on the weight of each term in the document to efficiently assemble all the documents relevant to a query from the P2P Network. To evaluate the efficiency of Concordia, we propose two data allocation methods. One is designed to gather relevant documents efficiently by allocating document replicas. The other is designed to handle frequent node leave by allocating chunks of encoded documents using an erasure code. Experimental results show that Concordia reduces the number of node accesses significantly to gather relevant documents.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"10","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌データベース（TOD）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2008-12-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"1"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":17372,"updated":"2025-01-22T23:22:10.754358+00:00","links":{},"created":"2025-01-18T22:50:23.477468+00:00"}