EFFICIENT FILE HASH IDENTIFIER COMPUTATION
    2.
    发明申请
    EFFICIENT FILE HASH IDENTIFIER COMPUTATION 审中-公开
    高效的文件哈希标识符计算

    公开(公告)号:WO2009045767A2

    公开(公告)日:2009-04-09

    申请号:PCT/US2008/077155

    申请日:2008-09-22

    Abstract: Described is maintaining cached hash values for files in association with state data for each file that represents the state of that file's contents at the time of hashing. For example, in a journaling file system, the state data may comprise the update sequence number of the file in the journal and a journal identifier for that journal instance. A request for a hash value for a file is processed by determining whether a cached hash value is maintained for that file. If so, and the associated maintained state data matches current state data for the file, the file contents are unchanged since the last hash computation, whereby the cached hash value is returned in response to the request. Otherwise, a new hash value is computed for the file and returned, and cached for future use. Multiple types of hashes may be cached for a given file.

    Abstract translation: 描述了维护文件的缓存哈希值与每个文件的状态数据相关联,该文件表示散列时该文件内容的状态。 例如,在日志文件系统中,状态数据可以包括日志中文件的更新序列号和该日志实例的日志标识符。 对文件的散列值的请求通过确定是否为该文件维护高速缓存散列值来处理。 如果是这样,并且相关联的维护状态数据与文件的当前状态数据相匹配,则自上次散列计算以来文件内容不变,由此响应于该请求返回缓存的散列值。 否则,将为该文件计算一个新的散列值并将其返回并缓存以供将来使用。 给定文件可以缓存多种类型的散列。

    EFFICIENT FILE HASH IDENTIFIER COMPUTATION
    4.
    发明公开
    EFFICIENT FILE HASH IDENTIFIER COMPUTATION 有权
    文件哈希标识符的有效计算

    公开(公告)号:EP2195749A2

    公开(公告)日:2010-06-16

    申请号:EP08835852.8

    申请日:2008-09-22

    Abstract: Described is maintaining cached hash values for files in association with state data for each file that represents the state of that file's contents at the time of hashing. For example, in a journaling file system, the state data may comprise the update sequence number of the file in the journal and a journal identifier for that journal instance. A request for a hash value for a file is processed by determining whether a cached hash value is maintained for that file. If so, and the associated maintained state data matches current state data for the file, the file contents are unchanged since the last hash computation, whereby the cached hash value is returned in response to the request. Otherwise, a new hash value is computed for the file and returned, and cached for future use. Multiple types of hashes may be cached for a given file.

Patent Agency Ranking