专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2013115822A1 SYSTEMS AND METHODS FOR DATA CHUNK DEDUPLICATION 审中-公开
标题翻译：用于数据重排的系统和方法
公开(公告)号：WO2013115822A1
公开(公告)日：2013-08-08
申请号：PCT/US2012/023649
申请日：2012-02-02
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , LILLIBRIDGE, Mark D. , ESHGHI, Kave , WATKINS, Mark R.
发明人： LILLIBRIDGE, Mark D. , ESHGHI, Kave , WATKINS, Mark R.
IPC分类号： G06F12/00
CPC分类号： G06F17/30159 , G06F3/0608 , G06F3/0641 , G06F3/067
摘要： A method includes receiving information about a plurality of data chunks and determining if one or more of a plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks where one of the plurality of back-end nodes is designated as a sticky node. The method further includes, responsive to determining that none of the plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks, deduplicating the plurality of data chunks against the back-end node designated as the sticky node. Finally, the method includes, responsive to an amount of data being processed, designating a different back-end node as the sticky node.
摘要翻译：一种方法包括接收关于多个数据块的信息，并且确定多个后端节点中的一个或多个是否已经存储多于多个后端节点中的一个被指定的多个数据块的阈值量作为粘性节点。所述方法还包括：响应于确定所述多个后端节点中没有一个已经存储多于所述多个数据块的阈值量，将所述多个数据块与所指定为所述粘性节点的所述后端节点重复去重复。最后，该方法包括响应于被处理的数据量，指定不同的后端节点作为粘性节点。

2. 发明申请

WO2011159322A1 DATA DEDUPLICATION 审中-公开
标题翻译：数据记录
公开(公告)号：WO2011159322A1
公开(公告)日：2011-12-22
申请号：PCT/US2010/051910
申请日：2010-10-08
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , ESHGHI, Kave , LILLIBRIDGE, Mark D. , FALKINDER, David M.
发明人： ESHGHI, Kave , LILLIBRIDGE, Mark D. , FALKINDER, David M.
IPC分类号： G06F12/16 , G06F9/06 , G06F13/14
CPC分类号： G06F11/1453 , G06F11/1469
摘要： A method for data deduplication includes receiving a set of hashes derived from a data chunk of a set of input data chunks 310. The method includes sampling the set of hashes 320, using an index indentifying data chunk containers that hold data chunks having a hash in the set of sampled hashes 330, and loading indexes for at least one of the identified data chunk containers 340. The method includes determining which of the hashes correspond to data chunks stored in data chunk containers corresponding to the loaded indexes 350 and deciding which of the set of input data chunks should be stored based at least in part on the determination.
摘要翻译：一种用于重复数据删除的方法包括接收从一组输入数据块310的数据块导出的一组散列。该方法包括使用保存具有散列的数据块的索引识别数据块容器对散列集合320进行采样该组采样散列330以及至少一个所识别的数据块容器340的加载索引。该方法包括确定散列中的哪一个对应于存储在对应于加载索引350的数据块容器中的数据块，并且确定哪个至少部分地基于确定来存储一组输入数据块。

3. 发明申请

WO2013165389A1 DETERMINING SEGMENT BOUNDARIES FOR DEDUPLICATION 审中-公开
标题翻译：确定分段边界
公开(公告)号：WO2013165389A1
公开(公告)日：2013-11-07
申请号：PCT/US2012/035917
申请日：2012-05-01
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , ESHGHI, Kave , FALKINDER, David M. , LILLIBRIDGE, Mark D.
发明人： ESHGHI, Kave , FALKINDER, David M. , LILLIBRIDGE, Mark D.
IPC分类号： G06F12/00 , G06F9/06
CPC分类号： G06F17/30159 , G06F3/0608 , G06F3/0641 , G06F3/067 , H04L67/1097
摘要： A sequence of hashes is received. Each hash corresponds to a data chunk of data to be deduplicated. Locations of previously stored copies of the data chunks are determined, the locations determined based on the hashes. A breakpoint in the sequence of data chunks is determined based on the locations, the breakpoint forming a boundary of a segment of data chunks.
摘要翻译：接收一系列散列。每个散列对应于要重复数据删除的数据块。确定先前存储的数据块的副本的位置，基于哈希确定的位置。基于位置，断点形成数据块段的边界来确定数据块序列中的断点。

4. 发明申请

WO2013165388A1 SEGMENT COMBINING FOR DEDUPLICATION 审中-公开
标题翻译：分段组合用于配对
公开(公告)号：WO2013165388A1
公开(公告)日：2013-11-07
申请号：PCT/US2012/035916
申请日：2012-05-01
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , LILLIBRIDGE, Mark D. , BHAGWAT, Deepavali M.
发明人： LILLIBRIDGE, Mark D. , BHAGWAT, Deepavali M.
IPC分类号： G06F12/00 , G06F9/06
CPC分类号： G06F17/30159 , G06F3/0608 , G06F3/0641 , G06F3/067
摘要： A non-transitory computer-readable storage device includes instructions that, when executed, cause one or more processors to receive a sequence of hashes. Next, the one or more processors are further caused to determine locations of previously stored copies of a subset of the data chunks corresponding to the hashes. The one or more processors are further caused to group hashes and corresponding data chunks into segments based in part on the determined information. The one or more processors are caused to choose, for each segment, a store to deduplicate that segment against. Finally, the one or more processors are further caused to combine two or more segments chosen to be deduplicated against the same store and deduplicate them as a whole using a second index.
摘要翻译：非暂时性计算机可读存储设备包括指令，当被执行时，使得一个或多个处理器接收一系列散列。接下来，进一步导致一个或多个处理器确定对应于散列的数据块的子集的先前存储的副本的位置。进一步导致一个或多个处理器部分地基于确定的信息将散列和对应的数据块分组成段。导致一个或多个处理器为每个段选择一个商店，以对其进行重复数据删除。最后，进一步导致一个或多个处理器组合两个或多个选择为相同商店进行重复数据删除的片段，并使用第二个索引将其整体重复使用。

5. 发明公开

EP2583183A1 DATA DEDUPLICATION 审中-公开
标题翻译：重复数据删除
公开(公告)号：EP2583183A1
公开(公告)日：2013-04-24
申请号：EP10853378.7
申请日：2010-10-08
申请人： Hewlett-Packard Development Company, L.P.
发明人： ESHGHI, Kave , LILLIBRIDGE, Mark D. , FALKINDER, David M.
IPC分类号： G06F12/16 , G06F9/06 , G06F13/14
CPC分类号： G06F11/1453 , G06F11/1469
摘要： A method for data deduplication includes receiving a set of hashes derived from a data chunk of a set of input data chunks 310. The method includes sampling the set of hashes 320, using an index indentifying data chunk containers that hold data chunks having a hash in the set of sampled hashes 330, and loading indexes for at least one of the identified data chunk containers 340. The method includes determining which of the hashes correspond to data chunks stored in data chunk containers corresponding to the loaded indexes 350 and deciding which of the set of input data chunks should be stored based at least in part on the determination.

6. 发明公开

EP2845107A1 SEGMENT COMBINING FOR DEDUPLICATION 审中-公开
标题翻译： SEGMENTKOMBINATION ZUR ENTDUPLIZIERUNG
公开(公告)号：EP2845107A1
公开(公告)日：2015-03-11
申请号：EP12876047.7
申请日：2012-05-01
申请人： Hewlett-Packard Development Company, L.P.
发明人： LILLIBRIDGE, Mark D. , BHAGWAT, Deepavali M.
IPC分类号： G06F12/00 , G06F9/06
CPC分类号： G06F17/30159 , G06F3/0608 , G06F3/0641 , G06F3/067
摘要： A non-transitory computer-readable storage device includes instructions that, when executed, cause one or more processors to receive a sequence of hashes. Next, the one or more processors are further caused to determine locations of previously stored copies of a subset of the data chunks corresponding to the hashes. The one or more processors are further caused to group hashes and corresponding data chunks into segments based in part on the determined information. The one or more processors are caused to choose, for each segment, a store to deduplicate that segment against. Finally, the one or more processors are further caused to combine two or more segments chosen to be deduplicated against the same store and deduplicate them as a whole using a second index.
摘要翻译：非暂时的计算机可读存储设备包括指令，当被执行时，使得一个或多个处理器接收一系列散列。接下来，进一步导致一个或多个处理器确定先前存储的与散列对应的数据块子集的副本的位置。进一步导致一个或多个处理器部分地基于所确定的信息将散列和对应的数据块分组成段。导致一个或多个处理器为每个段选择一个商店，以对其进行重复数据删除。最后，进一步导致一个或多个处理器组合两个或更多个被选择为相同商店进行重复数据删除的片段，并使用第二个索引作为整体进行重复数据删除。

7. 发明公开

EP2845106A1 DETERMINING SEGMENT BOUNDARIES FOR DEDUPLICATION 审中-公开
标题翻译：测定段限量的ENTDUPLIZIERUNG的
公开(公告)号：EP2845106A1
公开(公告)日：2015-03-11
申请号：EP12876001.4
申请日：2012-05-01
申请人： Hewlett-Packard Development Company, L.P.
发明人： ESHGHI, Kave , FALKINDER, David M. , LILLIBRIDGE, Mark D.
IPC分类号： G06F12/00 , G06F9/06
CPC分类号： G06F17/30159 , G06F3/0608 , G06F3/0641 , G06F3/067 , H04L67/1097
摘要： A sequence of hashes is received. Each hash corresponds to a data chunk of data to be deduplicated. Locations of previously stored copies of the data chunks are determined, the locations determined based on the hashes. A breakpoint in the sequence of data chunks is determined based on the locations, the breakpoint forming a boundary of a segment of data chunks.

8. 发明公开

EP2810171A1 SYSTEMS AND METHODS FOR DATA CHUNK DEDUPLICATION 有权转让
标题翻译：用于数据块重新分配的系统和方法
公开(公告)号：EP2810171A1
公开(公告)日：2014-12-10
申请号：EP12867467.8
申请日：2012-02-02
申请人： Hewlett-Packard Development Company, L.P.
发明人： LILLIBRIDGE, Mark D. , ESHGHI, Kave , WATKINS, Mark R.
IPC分类号： G06F12/00
CPC分类号： G06F16/1752 , G06F3/0608 , G06F3/0641 , G06F3/067
摘要： A method includes receiving information about a plurality of data chunks and determining if one or more of a plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks where one of the plurality of back-end nodes is designated as a sticky node. The method further includes, responsive to determining that none of the plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks, deduplicating the plurality of data chunks against the back-end node designated as the sticky node. Finally, the method includes, responsive to an amount of data being processed, designating a different back-end node as the sticky node.
摘要翻译：一种方法包括接收关于多个数据组块的信息并且确定多个后端节点中的一个或多个是否已经存储多于阈值量的多个数据组块，其中多个后端节点中的一个被指定作为一个粘性节点。该方法进一步包括，响应于确定多个后端节点中没有一个已经存储多于阈值量的多个数据组块，将该多个数据组块对照指定为粘滞节点的后端节点进行去重复。最后，该方法包括响应于正被处理的数据量，将不同的后端节点指定为粘滞节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式