中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

4 records (took 0.022 seconds)

    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION
    2.
    发明申请
    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION 审中-公开
    使用索引分割和调和进行数据重传

    公开(公告)号：WO2012092212A2

    公开(公告)日：2012-07-05

    申请号：PCT/US2011/067292

    申请日：2011-12-23

    Applicant: MICROSOFT CORPORATION

    Inventor： LI, Jin ,  SENGUPTA, Sudipta ,  KALACH, Ran ,  DESAI, Ronakkumar N. ,  OLTEAN, Paul Adrian ,  BENTON, James, Robert

    IPC: G06F12/00

    CPC classification number: G06F17/30371 ,  G06F17/30156 ,  G06F17/30303 ,  G06F17/30327 ,  G06F17/3033 ,  G06F17/30489

    Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index is partitioned into subspace indexes, with less than the entire hash index service's index cached to save memory. The subspace index is accessed to determine whether a data chunk already exists or needs to be indexed and stored. The index may be divided into subspaces based on criteria associated with the data to index, such as file type, data type, time of last usage, and so on. Also described is subspace reconciliation in which duplicate entries in subspaces are detected so as to remove entries and chunks from the deduplication system. Subspace reconciliation may be performed at off-peak time when more system resources are available, and may be interrupted if resources are needed. Subspaces to reconcile may be based on similarity, including via similarity of signatures that each compactly represents the subspace's hashes.

    Abstract translation: 本主题公开内容针对一种重复数据删除技术，其中将散列索引服务的索引划分为子空间索引，并且缓存整个散列索引服务的索引以节省存储空间。 子空间索引被访问以确定数据块是否已经存在或需要被索引和存储。 索引可根据与要索引的数据相关的条件划分为子空间，如文件类型，数据类型，上次使用时间等。 还描述了子空间协调，其中检测子空间中的重复条目以从重复删除系统中删除条目和块。 当有更多的系统资源可用时，可以在非高峰时间执行子空间对帐，并且如果需要资源，可能会中断子空间对帐。 要调和的子空间可能基于相似性，包括通过每个紧凑地表示子空间散列的签名的相似性。

    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION
    3.
    发明公开
    USING INDEX PARTITIONING AND RECONCILIATION FOR DATA DEDUPLICATION 审中-公开
    VERWENDUNG EINER INDEXPARTITIONIERUNG UND-ABSTIMMUNGFÜREINE DATENDEDUPLIZIERUNG

    公开(公告)号：EP2659376A2

    公开(公告)日：2013-11-06

    申请号：EP11852319.0

    申请日：2011-12-23

    Applicant: Microsoft Corporation

    Inventor： LI, Jin ,  SENGUPTA, Sudipta ,  KALACH, Ran ,  DESAI, Ronakkumar N. ,  OLTEAN, Paul Adrian ,  BENTON, James, Robert

    IPC: G06F12/00

    Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index is partitioned into subspace indexes, with less than the entire hash index service's index cached to save memory. The subspace index is accessed to determine whether a data chunk already exists or needs to be indexed and stored. The index may be divided into subspaces based on criteria associated with the data to index, such as file type, data type, time of last usage, and so on. Also described is subspace reconciliation, in which duplicate entries in subspaces are detected so as to remove entries and chunks from the deduplication system. Subspace reconciliation may be performed at off-peak time, when more system resources are available, and may be interrupted if resources are needed. Subspaces to reconcile may be based on similarity, including via similarity of signatures that each compactly represents the subspace's hashes.

    Abstract translation: 本发明涉及一种数据重复数据删除技术，其中散列索引服务的索引被划分为子空间索引，其中小于整个散列索引服务的索引来缓存内存。 访问子空间索引以确定数据块是否已经存在或需要进行索引和存储。 索引可以根据与要索引的数据相关联的标准被划分为子空间，例如文件类型，数据类型，最后使用时间等等。 还描述了子空间协调，其中检测子空间中的重复条目，以便从重复数据删除系统中删除条目和块。 当更多的系统资源可用时，子空间协调可以在非高峰时间执行，并且如果需要资源，则可能被中断。 调和的子空间可以基于相似性，包括通过相似性的签名，每个紧密地表示子空间的散列。

Patent Agency Ranking