P2P网络中基于分布式元数据缓存的搜索机制

2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops) Pub Date : 2005-01-31 DOI:10.1109/SAINTW.2005.102

Atsuhiro Kibe, Hiroyuki Nakamura, H. Sunaga

{"title":"P2P网络中基于分布式元数据缓存的搜索机制","authors":"Atsuhiro Kibe, Hiroyuki Nakamura, H. Sunaga","doi":"10.1109/SAINTW.2005.102","DOIUrl":null,"url":null,"abstract":"A new mechanism for P2P-based metadata discovery in a community dealing with high-mix low-volume content is proposed. The basic idea is to narrow down candidates for favourite content by using metadata elements, not by using so-called genres Evaluation results obtained from a simulation indicate that the proposed mechanism achieves the high efficiency from the view point of the amount of cache and the number of discovery hops.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Search Mechanism Using Distributed Metadata Caching in P2P Networks\",\"authors\":\"Atsuhiro Kibe, Hiroyuki Nakamura, H. Sunaga\",\"doi\":\"10.1109/SAINTW.2005.102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new mechanism for P2P-based metadata discovery in a community dealing with high-mix low-volume content is proposed. The basic idea is to narrow down candidates for favourite content by using metadata elements, not by using so-called genres Evaluation results obtained from a simulation indicate that the proposed mechanism achieves the high efficiency from the view point of the amount of cache and the number of discovery hops.\",\"PeriodicalId\":220913,\"journal\":{\"name\":\"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SAINTW.2005.102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAINTW.2005.102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种新的基于p2p的社区元数据发现机制，用于处理高混合、低容量的内容。其基本思想是通过使用元数据元素而不是使用所谓的类型来缩小喜爱内容的候选范围。仿真结果表明，从缓存量和发现跳数的角度来看，所提出的机制达到了较高的效率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Search Mechanism Using Distributed Metadata Caching in P2P Networks

A new mechanism for P2P-based metadata discovery in a community dealing with high-mix low-volume content is proposed. The basic idea is to narrow down candidates for favourite content by using metadata elements, not by using so-called genres Evaluation results obtained from a simulation indicate that the proposed mechanism achieves the high efficiency from the view point of the amount of cache and the number of discovery hops.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)

自引率

0.00%

发文量