摘要
在P2P文件共享系统里,通过文件描述可以描述文件的集合并且可以用它来决定查询的路由。但在这种模型下,会出现虚假匹配的现象,从而导致网络带宽和计算资源的浪费。文章提出了一种基于查询命中日志方法来较精确地划分网络结点文件描述的策略来减小虚假同现的发生,来提高查询路由的效率。
In P2P file sharing system, the description of file is used to describe the set of files. This information can be used to guide routing decisions. However, in this model, there may exists false co-occurrences phenomenon, therefore it wastes network bandwidth and computer resources. A method based on query hit log strategy that can partition accurately description of file of network node in order to reduce the occurrence of false co-occurrences and to improve effective of query routing.
出处
《计算机与数字工程》
2009年第8期105-108,156,共5页
Computer & Digital Engineering
关键词
虚假同现
查询命中日志
查询关联
false co-occurrences, query hit log, query relevancy
