-
公开(公告)号：US09038168B2
公开(公告)日：2015-05-19
申请号：US12622441
申请日：2009-11-20
申请人： Nir Ben-Zvi , Raja Pazhanivel Perumal , Anders Samuelsson , Jeffrey B. Hamblin , Ran Kalach , Ziquan Li , Matthias H. Wollnik , Clyde Law , Paul Adrian Oltean
发明人： Nir Ben-Zvi , Raja Pazhanivel Perumal , Anders Samuelsson , Jeffrey B. Hamblin , Ran Kalach , Ziquan Li , Matthias H. Wollnik , Clyde Law , Paul Adrian Oltean
CPC分类号： G06F21/6218 , G06F2221/2141
摘要： Described is a technology by which access to a resource is determined by evaluating a resource label of the resource against a user claim of an access request, according to policy decoupled from the resource. The resource may be a file, and the resource label may be obtained by classifying the file into classification properties, such that a change to the file may change its resource label, thereby changing which users have access to the file. The resource label-based access evaluation may be logically combined with a conventional ACL-based access evaluation to determine whether to grant or deny access to the resource.
摘要翻译： 描述了根据从资源分离的策略来评估资源的资源标签以针对访问请求的用户权利要求来确定对资源的访问的技术。 资源可以是文件，并且可以通过将文件分类为分类属性来获得资源标签，使得文件的改变可以改变其资源标签，从而改变哪些用户有权访问该文件。 基于资源标签的访问评估可以逻辑地与传统的基于ACL的访问评估组合以确定是否授予或拒绝对资源的访问。
-
22.发明申请公开(公告)号：US20130054544A1
公开(公告)日：2013-02-28
申请号：US13222198
申请日：2011-08-31
申请人： Jin Li , Sudipta Sengupta , Sanjeev Mehrotra , Ran Kalach , Paul Adrian Oltean
发明人： Jin Li , Sudipta Sengupta , Sanjeev Mehrotra , Ran Kalach , Paul Adrian Oltean
IPC分类号： G06F7/00
CPC分类号： G06F7/00 , G06F3/0608 , G06F3/0641 , G06F3/0674 , G06F11/1004 , G06F17/30159
摘要： The subject disclosure is directed towards partitioning a file into chunks that satisfy a chunk size restriction, such as maximum and minimum chunk sizes, using a sliding window. For file positions within the chunk size restriction, a signature representative of a window fingerprint is compared with a target pattern, with a chunk boundary candidate identified if matched. Other signatures and patterns are then checked to determine a highest ranking signature (corresponding to a lowest numbered Rule) to associate with that chunk boundary candidate, or set an actual boundary if the highest ranked signature is matched. If the maximum chunk size is reached without matching the highest ranked signature, the chunking mechanism regresses to set the boundary based on the candidate with the next highest ranked signature (if no candidates, the boundary is set at the maximum). Also described is setting chunk boundaries based upon pattern detection (e.g., runs of zeros).
摘要翻译： 本发明涉及使用滑动窗口将文件分成满足块大小限制的块，例如最大和最小块大小。 对于块大小限制内的文件位置，将窗口指纹的签名代表与目标模式进行比较，如果匹配则识别出块边界候选。 然后检查其他签名和模式以确定与该块块边界候选者相关联的最高排名签名（对应于最小编号的规则），或者如果最高排名签名匹配则设置实际边界。 如果没有匹配最高排名的签名达到最大块大小，则分块机制基于具有下一个最高排名的签名的候选者（如果没有候选，边界被设置为最大）而退化以设置边界。 还描述了基于模式检测（例如，零的运行）设置块边界。
-
公开(公告)号：US20110126281A1
公开(公告)日：2011-05-26
申请号：US12622441
申请日：2009-11-20
申请人： Nir Ben-Zvi , Raja Pazhanivel Perumal , Anders Samuelsson , Jeffrey B. Hamblin , Ran Kalach , Ziquan Li , Matthias H. Wollnik , Clyde Law , Paul Adrian Oltean
发明人： Nir Ben-Zvi , Raja Pazhanivel Perumal , Anders Samuelsson , Jeffrey B. Hamblin , Ran Kalach , Ziquan Li , Matthias H. Wollnik , Clyde Law , Paul Adrian Oltean
CPC分类号： G06F21/6218 , G06F2221/2141
摘要： Described is a technology by which access to a resource is determined by evaluating a resource label of the resource against a user claim of an access request, according to policy decoupled from the resource. The resource may be a file, and the resource label may be obtained by classifying the file into classification properties, such that a change to the file may change its resource label, thereby changing which users have access to the file. The resource label-based access evaluation may be logically combined with a conventional ACL-based access evaluation to determine whether to grant or deny access to the resource.
摘要翻译： 描述了根据从资源分离的策略来评估资源的资源标签以针对访问请求的用户权利要求来确定对资源的访问的技术。 资源可以是文件，并且可以通过将文件分类为分类属性来获得资源标签，使得文件的改变可以改变其资源标签，从而改变哪些用户有权访问该文件。 基于资源标签的访问评估可以逻辑地与传统的基于ACL的访问评估组合以确定是否授予或拒绝对资源的访问。
-
公开(公告)号：US07548939B2
公开(公告)日：2009-06-16
申请号：US11107119
申请日：2005-04-15
申请人： Ran Kalach , James R. Benton , Paul Adrian Oltean
发明人： Ran Kalach , James R. Benton , Paul Adrian Oltean
IPC分类号： G06F17/30
CPC分类号： G06F11/3409 , G06F11/3485 , Y10S707/99953 , Y10S707/99954
摘要： Described is a method and system by which storage reports are generated from a volume snapshot set, rather than from a live volume. A volume snapshot set includes a representation or copy of a volume at a single point in time. By scanning the snapshot, a consistent file system image is obtained. Scanning may take place by enumerating a volume's directories of files, or, when available, by accessing a file system metadata of file information (e.g., a master file table) separately maintained on the volume. With some (e.g., hardware-based) snapshot technologies, the snapshot can be transported to another computing system for scanning by that other computing system, thereby avoiding burdening a live system's resources when scanning. Accurate and consistent storage reports are thus obtained at a single point in time, independent of the number of volumes being scanned.
摘要翻译： 描述了一种方法和系统，通过该方法和系统从卷快照集生成存储报告，而不是从实时卷生成。 卷快照集包括在单个时间点的卷的表示或副本。 通过扫描快照，获得一致的文件系统映像。 可以通过枚举卷的文件目录，或者在可用时通过访问单独维护在卷上的文件信息（例如，主文件表）的文件系统元数据来进行扫描。 利用一些（例如基于硬件的）快照技术，快照可以被传送到另一个计算系统，以便由其他计算系统进行扫描，从而避免在扫描时负担现场系统的资源。 因此，在单个时间点上获得了准确和一致的存储报告，与被扫描的卷数无关。
-
公开(公告)号：US07401080B2
公开(公告)日：2008-07-15
申请号：US11206710
申请日：2005-08-17
IPC分类号： G06F12/06
CPC分类号： G06F17/30097 , Y10S707/99937
摘要： Described is a storage reports duplicate file detector that operates by receiving file records during a first scan of file system metadata. The detector computes a hash based on attributes in the record, and maintains the hash value in association with information that indicates whether a hash value corresponds to more than one file. In one implementation, the information corresponds to the amount of space wasted by duplication. The information is used to determine which hash values correspond to groups of potentially duplicate files, and eliminate non-duplicates. A second scan locates file information for each of the potentially duplicate files, and the file information is then used to determine which groups of potentially duplicate files are actually duplicate files.
摘要翻译： 描述的是存储报告重复文件检测器，其通过在文件系统元数据的第一次扫描期间接收文件记录来操作。 检测器基于记录中的属性来计算散列，并且将哈希值与指示散列值是否对应于多于一个文件的信息相关联地维护。 在一个实现中，信息对应于通过重复浪费的空间量。 该信息用于确定哪些哈希值对应于潜在重复文件的组，并消除不重复的数据。 第二次扫描查找每个潜在重复文件的文件信息，然后使用文件信息来确定哪些可能重复的文件组实际上是重复的文件。
-
26.发明申请GARBAGE COLLECTION AND HOTSPOTS RELIEF FOR A DATA DEDUPLICATION CHUNK STORE 审中-公开GARBAGE收藏和休息用于数据重复存储商店公开(公告)号：US20120159098A1
公开(公告)日：2012-06-21
申请号：US12971694
申请日：2010-12-17
CPC分类号： G06F12/0261
摘要： Techniques for garbage collecting unused data chunks in storage are provided. According to one implementation, data chunks stored in a chunk container that are unused are identified based an analysis of one or more stream map chunks indicated as deleted. The identified data chunks are indicated as deleted. The storage space in the chunk container filled by the data chunks indicated as deleted may then be reclaimed. Techniques for selectively backing up data chunks are also provided. According to one implementation, a data chunk is received for storing in a chunk container. A backup copy of the received data chunk is stored in a backup container if the received data chunk is in a predetermined top percentage of most referenced data chunks in the chunk container and has a number of references greater than a predetermined reference threshold.
摘要翻译： 提供垃圾收集存储器中未使用的数据块的技术。 根据一个实施方式，基于被指示为已删除的一个或多个流映射块的分析来识别存储在未使用的块容器中的数据块。 标识的数据块被表示为已删除。 然后可以回收由指定为已删除的数据块填充的块容器中的存储空间。 还提供了用于选择性地备份数据块的技术。 根据一个实施方式，接收用于存储在块容器中的数据块。 如果接收到的数据块处于块容器中大多数引用的数据块的预定最大百分比并且具有大于预定参考阈值的引用数量，则将所接收的数据块的备份副本存储在备份容器中。
-
公开(公告)号：US07293044B2
公开(公告)日：2007-11-06
申请号：US10821303
申请日：2004-04-09
申请人： Vishal Vikram Ghotge , David P. Golds , Sarosh Cyrus Havewala , Christopher F. Robert , Paul Adrian Oltean
发明人： Vishal Vikram Ghotge , David P. Golds , Sarosh Cyrus Havewala , Christopher F. Robert , Paul Adrian Oltean
CPC分类号： G06F11/0727 , G06F11/0751 , G06F21/64 , Y10S707/99953
摘要： A method and system for verifying the integrity of a storage volume. When volume verification is desired, a shadow copy of the volume is created. A verification tool operates on the shadow copy and provides a report that indicates if any errors are found in the shadow copy. If errors are found on the shadow copy, this indicates that the same errors likely still exist on the live volume. In the event of errors, a system administrator or the like may take the live volume off-line and fix the errors found.
摘要翻译： 一种用于验证存储卷的完整性的方法和系统。 当需要卷验证时，会创建卷的卷影副本。 验证工具对卷影副本进行操作，并提供一个报告，指示是否在卷影副本中找到任何错误。 如果在卷影副本上找到错误，则表示在实际卷上可能仍然存在相同的错误。 在发生错误的情况下，系统管理员等可能会将现场音量离线并修复发现的错误。
-
公开(公告)号：US09189488B2
公开(公告)日：2015-11-17
申请号：US13081497
申请日：2011-04-07
CPC分类号： G06F17/30156 , G06F21/10
摘要： Hash values corresponding to a file are processed in windows to determine a minimum hash value for each window. Each window may begin at a minimum hash value determined for a previous window and end after a fixed number of hash values. If a hash value is less than a threshold hash value, it is added to a buffer that is used to store the hash values in sorted order for a current window. If a hash value is greater than the threshold, it is added to another buffer whose hash values are not stored in sorted order. At the end of the current window, the minimum hash value in the first buffer is selected as the landmark for the window. If the first buffer is empty, then the hash values in the other buffer are sorted and the minimum hash value is selected as the landmark for the window.
摘要翻译： 在窗口中处理与文件相对应的哈希值，以确定每个窗口的最小哈希值。 每个窗口可以以对于前一窗口确定的最小散列值开始，并在固定数量的散列值之后结束。 如果哈希值小于阈值哈希值，则将其添加到缓冲区中，该缓冲区用于按当前窗口的排序顺序存储哈希值。 如果哈希值大于阈值，则将其添加到另一个缓冲区，其哈希值不按排序顺序存储。 在当前窗口的末尾，第一个缓冲区中的最小哈希值被选为窗口的里程碑。 如果第一个缓冲区为空，则另一个缓冲区中的哈希值被排序，并选择最小哈希值作为窗口的标志。
-
公开(公告)号：US20120259897A1
公开(公告)日：2012-10-11
申请号：US13081497
申请日：2011-04-07
IPC分类号： G06F17/30
CPC分类号： G06F17/30156 , G06F21/10
摘要： Hash values corresponding to a file are processed in windows to determine a minimum hash value for each window. Each window may begin at a minimum hash value determined for a previous window and end after a fixed number of hash values. If a hash value is less than a threshold hash value, it is added to a buffer that is used to store the hash values in sorted order for a current window. If a hash value is greater than the threshold, it is added to another buffer whose hash values are not stored in sorted order. At the end of the current window, the minimum hash value in the first buffer is selected as the landmark for the window. If the first buffer is empty, then the hash values in the other buffer are sorted and the minimum hash value is selected as the landmark for the window.
摘要翻译： 在窗口中处理与文件相对应的哈希值，以确定每个窗口的最小哈希值。 每个窗口可以以对于前一窗口确定的最小散列值开始，并在固定数量的散列值之后结束。 如果哈希值小于阈值哈希值，则将其添加到缓冲区中，该缓冲区用于按当前窗口的排序顺序存储哈希值。 如果哈希值大于阈值，则将其添加到另一个缓冲区，其哈希值不按排序顺序存储。 在当前窗口的末尾，第一个缓冲区中的最小哈希值被选为窗口的里程碑。 如果第一个缓冲区为空，则另一个缓冲区中的哈希值被排序，并选择最小哈希值作为窗口的里程碑。
-
公开(公告)号：US07877553B2
公开(公告)日：2011-01-25
申请号：US11834028
申请日：2007-08-06
IPC分类号： G06F13/00
CPC分类号： G06F11/2074 , G06F11/2041 , G06F11/2048 , G06F17/30088
摘要： Aspects of the subject matter described herein relate to sharing volume data via shadow copies. In aspects, an active computer creates a shadow copy of a volume. The shadow copy is exposed to one or more passive computers that may read but not write to the volume. A passive computer may obtain data from the shadow copy by determining whether the data has been written to a differential area and, if so, reading it from the differential area. If the data has not been written to the differential area, the passive computer may obtain it by first reading it from the volume, then re-determining whether it has been written to the differential area, and if so, reading the data from the differential area. Otherwise, the data read from the volume corresponds to the data needed for the shadow copy.
摘要翻译： 本文描述的主题的方面涉及通过卷影副本共享卷数据。 在方面，活动计算机创建卷的卷影副本。 影子副本暴露给可能读取但不写入卷的一个或多个被动计算机。 无源计算机可以通过确定数据是否被写入差分区域而从影子拷贝获得数据，如果是，则从差分区域读取数据。 如果数据尚未写入差分区域，则无源计算机可以通过首先从卷中读取数据，然后重新确定是否将其写入差分区域，如果是，则从差分读取数据 区。 否则，从卷读取的数据对应于卷影副本所需的数据。
-
-
-
-
-
-
-
-
-
搜索结果
36 条记录 (耗时 0.026 秒)
