会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Optimization of fingerprint-based deduplication
    • 基于指纹的重复数据删除优化
    • US09047304B2
    • 2015-06-02
    • US13305218
    • 2011-11-28
    • Mark L. YakushevMark A. Smith
    • Mark L. YakushevMark A. Smith
    • G06F17/30
    • G06F17/30159G06F17/30156
    • Described are embodiments of an invention for identifying chunk boundaries for optimization of fingerprint-based deduplication in a computing environment. Storage objects that are backed up in a computing environment are often compound storage objects which include many individual storage objects. The computing device of the computing environment breaks the storage objects into chunks of data by determining a hash value on a range of data. The computing device creates an artificial chunk boundary when the end of data of the storage object is reached. When an artificial chunk boundary is created for the end of data of a storage object, the computing device stores a pseudo fingerprint for the artificial chunk boundary. If a hash value matches a fingerprint or a pseudo fingerprint, then the computing device determines that the range of data corresponds to a chunk and the computing system defines the chunk boundaries.
    • 描述了用于识别用于在计算环境中优化基于指纹的重复数据删除的块边界的发明的实施例。 在计算环境中备份的存储对象通常是复合存储对象,包括许多单独的存储对象。 计算环境的计算设备通过确定数据范围上的哈希值来将存储对象分解成数据块。 当到达存储对象的数据结束时,计算设备创建一个人造块边界。 当为存储对象的数据结束创建人造块边界时,计算装置存储用于人造块边界的伪指纹。 如果哈希值与指纹或伪指纹匹配,则计算设备确定数据范围对应于块,并且计算系统定义块边界。
    • 3. 发明授权
    • Identifying modified chunks in a data set for storage
    • 识别用于存储的数据集中的修改的块
    • US08612392B2
    • 2013-12-17
    • US13103977
    • 2011-05-09
    • Mark L. YakushevMark A. Smith
    • Mark L. YakushevMark A. Smith
    • G06F7/00
    • G06F3/0653G06F3/0604G06F3/0608G06F3/0641G06F3/0673G06F3/0688G06F3/0689G06F17/30159
    • Provided are a computer program product, system, and method for identifying modified chunks in a data set for storage. Information is maintained on a data set of variable length chunks, including a digest of each chunk and information to locate the chunk in the data set. Modifications are received to at least one of the chunks in the data set. A determination is made of at least one range of least one of the chunks including data affected by the modifications, wherein each range identifies one chunk or sequential chunks having data affected by the modifications. The at least one chunk in each range is processed to determine at least one new chunk in each range, and for each determined new chunk, a digest of the new chunk. A determination is made as to whether at least one chunk outside of the at least one range has changed. For each determined at least one chunk outside of the at least one range that has changed, a determination is made of at least one new chunk and a new digest of the at least one new chunk. Adding to the set information the new digest information on the at least one new chunk and information to locate the new chunk in the data set.
    • 提供了用于识别用于存储的数据集中的修改的块的计算机程序产品,系统和方法。 信息被保存在可变长度块的数据集上,包括每个块的摘要和用于定位数据集中的块的信息。 修改被接收到数据集中的至少一个块。 确定包括受修改影响的数据的块中的至少一个块的至少一个范围,其中每个范围标识具有受修改影响的数据的一个块或连续块。 处理每个范围中的至少一个块以确定每个范围中的至少一个新块,并且对于每个确定的新块,新块的摘要。 确定至少一个范围之外的至少一个块是否已经改变。 对于已经改变的至少一个范围之外的每个确定的至少一个块,确定至少一个新块的至少一个新块和新摘要。 将关于至少一个新块的新摘要信息和信息添加到集合信息中以在数据集中定位新块。
    • 4. 发明申请
    • OPTIMIZATION OF FINGERPRINT-BASED DEDUPLICATION
    • 指纹识别优化
    • US20130138620A1
    • 2013-05-30
    • US13305218
    • 2011-11-28
    • Mark L. YakushevMark A. Smith
    • Mark L. YakushevMark A. Smith
    • G06F17/30
    • G06F17/30159G06F17/30156
    • Described are embodiments of an invention for identifying chunk boundaries for optimization of fingerprint-based deduplication in a computing environment. Storage objects that are backed up in a computing environment are often compound storage objects which include many individual storage objects. The computing device of the computing environment breaks the storage objects into chunks of data by determining a hash value on a range of data. The computing device creates an artificial chunk boundary when the end of data of the storage object is reached. When an artificial chunk boundary is created for the end of data of a storage object, the computing device stores a pseudo fingerprint for the artificial chunk boundary. If a hash value matches a fingerprint or a pseudo fingerprint, then the computing device determines that the range of data corresponds to a chunk and the computing system defines the chunk boundaries.
    • 描述了用于识别用于在计算环境中优化基于指纹的重复数据删除的块边界的发明的实施例。 在计算环境中备份的存储对象通常是复合存储对象,包括许多单独的存储对象。 计算环境的计算设备通过确定数据范围上的哈希值来将存储对象分解成数据块。 当到达存储对象的数据结束时,计算设备创建一个人造块边界。 当为存储对象的数据结束创建人造块边界时,计算装置存储用于人造块边界的伪指纹。 如果哈希值与指纹或伪指纹匹配,则计算设备确定数据范围对应于块,并且计算系统定义块边界。
    • 5. 发明申请
    • IDENTIFYING MODIFIED CHUNKS IN A DATA SET FOR STORAGE
    • 在存储的数据集中识别修改的信息
    • US20120290537A1
    • 2012-11-15
    • US13103977
    • 2011-05-09
    • Mark A. SmithMark L. Yakushev
    • Mark A. SmithMark L. Yakushev
    • G06F7/00G06F17/30
    • G06F3/0653G06F3/0604G06F3/0608G06F3/0641G06F3/0673G06F3/0688G06F3/0689G06F17/30159
    • Provided are a computer program product, system, and method for identifying modified chunks in a data set for storage. Information is maintained on a data set of variable length chunks, including a digest of each chunk and information to locate the chunk in the data set. Modifications are received to at least one of the chunks in the data set. A determination is made of at least one range of least one of the chunks including data affected by the modifications, wherein each range identifies one chunk or sequential chunks having data affected by the modifications. The at least one chunk in each range is processed to determine at least one new chunk in each range, and for each determined new chunk, a digest of the new chunk. A determination is made as to whether at least one chunk outside of the at least one range has changed. For each determined at least one chunk outside of the at least one range that has changed, a determination is made of at least one new chunk and a new digest of the at least one new chunk. Adding to the set information the new digest information on the at least one new chunk and information to locate the new chunk in the data set.
    • 提供了用于识别用于存储的数据集中的修改的块的计算机程序产品,系统和方法。 信息被保存在可变长度块的数据集上,包括每个块的摘要和用于定位数据集中的块的信息。 修改被接收到数据集中的至少一个块。 确定包括受修改影响的数据的块中的至少一个块的至少一个范围,其中每个范围标识具有受修改影响的数据的一个块或连续块。 处理每个范围中的至少一个块以确定每个范围中的至少一个新块,并且对于每个确定的新块,新块的摘要。 确定至少一个范围之外的至少一个块是否已经改变。 对于已经改变的至少一个范围之外的每个确定的至少一个块,确定至少一个新块的至少一个新块和新摘要。 将关于至少一个新块的新摘要信息和信息添加到集合信息中以在数据集中定位新块。
    • 8. 发明授权
    • Disposable assembly for a reusable urn or vessel
    • 可重复使用的瓮或容器的一次性装配
    • US08757441B2
    • 2014-06-24
    • US13645315
    • 2012-10-04
    • Mark A. SmithCarsten Pfromm
    • Mark A. SmithCarsten Pfromm
    • B65D35/56
    • B67D3/0067B67D3/0054B67D3/0061B67D3/041B67D2210/00049F16K7/06
    • The present invention provides a container assembly for use with a reusable urn or vessel. The assembly includes a (1) flexible pouch, (2) a fitment connected to the pouch and having a flexible flange and a first fluid passageway therethrough in fluid communication with the chamber, (3) a tubing adapter having a first end connected to the fitment and a second end having a member for connecting to a tubing and a second fluid passageway in fluid communication with the first fluid passageway; and (4) wherein the flexible flange is capable of bending to conform to an interior wall of the urn or vessel to place the second fluid passageway in alignment with an axis of a through hole in the urn or vessel.
    • 本发明提供一种与可重复使用的瓮或容器一起使用的容器组件。 组件包括(1)柔性袋,(2)连接到袋并具有柔性凸缘和通过其与腔室流体连通的第一流体通道的配件,(3)管接头,其具有连接到 配件和具有用于连接到管道的构件和与第一流体通道流体连通的第二流体通道的第二端; 和(4)其中柔性凸缘能够弯曲以符合瓮或容器的内壁,以将第二流体通道与瓮或容器中的通孔的轴线对准。