{"created":"2023-06-20T12:57:21.192988+00:00","id":1399,"links":{},"metadata":{"_buckets":{"deposit":"f0389702-d00e-4988-b54f-4a273d6168d5"},"_deposit":{"created_by":2,"id":"1399","owners":[2],"pid":{"revision_id":0,"type":"depid","value":"1399"},"status":"published"},"_oai":{"id":"oai:fun.repo.nii.ac.jp:00001399","sets":["22:33","25:26:52"]},"author_link":["2551","30","33"],"item_9_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2011-03","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"392","bibliographicPageStart":"391","bibliographicVolumeNumber":"3","bibliographic_titles":[{}]}]},"item_9_description_3":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"分散ハッシュテーブル（DHT）はデータを保持するノードが分散配置されている環境において，比較的少ないホップ数でノードの検索が可能な技術である．DHTではルーティング経路上のノードと通信を行う  方式として，大別して再帰探索と反復探索（の2つがある．これらの探索方式は互いに優劣があるため，どちらかの探索方式のみでは利点が活かされない場合がある．よって,  利用する状況に応じて探索方式を選定する必要がある．\nそこで本研究では,  再帰探索と反復探索の適切な利用を考慮し，ネットワークの安定性で階層化を行う階層型DHTへ効率的な探索方式の適用を検討する．","subitem_description_type":"Abstract"}]},"item_9_description_4":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"情報処理学会第73回全国大会","subitem_description_type":"Other"}]},"item_9_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会"}]},"item_9_select_10":{"attribute_name":"単著共著","attribute_value_mlt":[{"subitem_select_item":"共著/joint"}]},"item_9_select_8":{"attribute_name":"査読有無","attribute_value_mlt":[{"subitem_select_item":"なし/no"}]},"item_9_select_9":{"attribute_name":"研究業績種別","attribute_value_mlt":[{"subitem_select_item":"国内学会/Domestic Conference"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"metadata only access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_14cb"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"舟橋, 知論"}],"nameIdentifiers":[{"nameIdentifier":"2551","nameIdentifierScheme":"WEKO"}]},{"creatorAffiliations":[{"affiliationNameIdentifiers":[{"affiliationNameIdentifier":"","affiliationNameIdentifierScheme":"ISNI","affiliationNameIdentifierURI":"http://www.isni.org/isni/"}],"affiliationNames":[{"affiliationName":"","affiliationNameLang":"ja"}]}],"creatorNames":[{"creatorName":"白石, 陽","creatorNameLang":"ja"}],"familyNames":[{"familyName":"白石","familyNameLang":"ja"}],"givenNames":[{"givenName":"陽","givenNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"30","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"90396797","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=90396797"}]},{"creatorAffiliations":[{"affiliationNameIdentifiers":[{"affiliationNameIdentifier":"","affiliationNameIdentifierScheme":"ISNI","affiliationNameIdentifierURI":"http://www.isni.org/isni/"}],"affiliationNames":[{"affiliationName":"","affiliationNameLang":"ja"}]}],"creatorNames":[{"creatorName":"高橋, 修","creatorNameLang":"ja"}],"familyNames":[{"familyName":"高橋","familyNameLang":"ja"}],"givenNames":[{"givenName":"修","givenNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"33","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"60381282","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=60381282"}]}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"階層型DHT  における探索手法の効率的な適用に関する検討","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"階層型DHT  における探索手法の効率的な適用に関する検討"}]},"item_type_id":"9","owner":"2","path":["33","52"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-04-18"},"publish_date":"2011-04-18","publish_status":"0","recid":"1399","relation_version_is_last":true,"title":["階層型DHT  における探索手法の効率的な適用に関する検討"],"weko_creator_id":"2","weko_shared_id":-1},"updated":"2025-02-07T03:17:04.861028+00:00"}