会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Sub-block partitioning for hash-based deduplication
    • 用于基于哈希的重复数据删除的子块分区
    • US09164688B2
    • 2015-10-20
    • US13541009
    • 2012-07-03
    • Lior AronovichMichael Hirsch
    • Lior AronovichMichael Hirsch
    • G06F17/30G06F7/02G06F3/06
    • G06F17/30371G06F3/0608G06F3/0641G06F3/067G06F17/30156G06F17/30159G06F17/3033G06F17/30424G06F17/30864
    • Sub-block partitioning for hash-based deduplication is performed by defining a minimal size and maximum size of the sub-block. For each boundary start position of the sub-block, starting a search, after the minimal size of the sub-block, for a boundary position of a subsequent sub-block by using multiple search criteria to test hash values that are calculated during the search. If one of the multiple search criteria is satisfied by one of the hash values, declaring the position of the hash value as a boundary end position of the sub-block. If the maximum size of the sub-block is reached prior to satisfying one of the multiple search criteria, declaring a position of an alternative one of the hash values that is selected based upon another one of the multiple search criteria as the boundary end position of the sub-block.
    • 通过定义子块的最小大小和最大大小来执行用于基于哈希的重复数据删除的子块分区。 对于子块的每个边界开始位置,通过使用多个搜索准则来测试在搜索期间计算的哈希值,在子块的最小尺寸之后开始搜索后续子块的边界位置 。 如果通过散列值之一满足多个搜索条件之一,则将哈希值的位置声明为子块的边界结束位置。 如果在满足多个搜索条件之一之前达到子块的最大大小,则声明基于多个搜索准则中的另一个来选择的替代的一个散列值的位置作为多个搜索条件的边界结束位置 子块。