首页> 外文会议>Advances in grid and pervasive computing >Supporting Filename Partial Matches in Structured Peer-to-Peer Overlay
【24h】

Supporting Filename Partial Matches in Structured Peer-to-Peer Overlay

机译:在结构化对等覆盖中支持文件名部分匹配

获取原文
获取原文并翻译 | 示例

摘要

In recent years, research issues associated with peer-to-peer (P2P) systems have been discussed widely. To resolve the file-availability problem and improve the workload, a method called the Distributed Hash Table (DHT) has been proposed. However, DHT-based systems in structured architectures cannot support efficient queries, such as a similarity query, range query, and partial-match query, due to the characteristics of the hash function. This study presents a novel scheme that supports filename partial-matches in structured P2P systems. The proposed approach supports complex queries and guarantees result quality. Experimental results demonstrate the effectiveness of the proposed approach.
机译:近年来,与对等(P2P)系统相关的研究问题已得到广泛讨论。为了解决文件可用性问题并提高工作量,提出了一种称为分布式哈希表(DHT)的方法。但是,由于散列函数的特性,结构化体系结构中基于DHT的系统无法支持有效查询,例如相似性查询,范围查询和部分匹配查询。这项研究提出了一种新颖的方案,该方案在结构化P2P系统中支持文件名部分匹配。所提出的方法支持复杂的查询并保证结果质量。实验结果证明了该方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号