会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Storage reports duplicate file detection
    • 存储报告重复文件检测
    • US20070043757A1
    • 2007-02-22
    • US11206710
    • 2005-08-17
    • James BentonRan KalachPaul OlteanGeorgi Matev
    • James BentonRan KalachPaul OlteanGeorgi Matev
    • G06F7/00
    • G06F17/30097Y10S707/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.
    • 描述的是存储报告重复文件检测器,其通过在文件系统元数据的第一次扫描期间接收文件记录来操作。 检测器基于记录中的属性来计算散列,并且将哈希值与指示散列值是否对应于多于一个文件的信息相关联地维护。 在一个实现中,信息对应于通过重复浪费的空间量。 该信息用于确定哪些哈希值对应于潜在重复文件的组,并消除不重复的数据。 第二次扫描查找每个潜在重复文件的文件信息,然后使用文件信息来确定哪些可能重复的文件组实际上是重复的文件。
    • 5. 发明申请
    • Storage reports file system scanner
    • 存储报告文件系统扫描器
    • US20070043747A1
    • 2007-02-22
    • US11206425
    • 2005-08-17
    • James BentonRan KalachPaul OlteanSarosh Havewala
    • James BentonRan KalachPaul OlteanSarosh Havewala
    • G06F7/00
    • G06F17/30067Y10S707/99942
    • Described is a storage reports scanner that works to generate reports of storage usage in computer systems in an efficient manner. The scanner receives a set of namespaces for a file system volume from a storage reports engine. The scanner scans file system metadata to construct a directory table of entries corresponding to a directory tree of nodes representative of the hierarchy of directories of the file system volume. Each node corresponding to a namespace in the namespace set is marked as included. A second scan of the file system metadata determines, for each file, whether that file is in or under an included directory by accessing the directory table. For each file that is in or is under an included directory, file information is returned to the engine. The engine may request the scanner to provide full path information, which the scanner determines via the directory table.
    • 描述了一种存储报告扫描器,用于以有效的方式生成计算机系统中的存储使用的报告。 扫描仪从存储报告引擎接收一组文件系统卷的命名空间。 扫描仪扫描文件系统元数据以构成与表示文件系统卷的目录的层次结构的节点的目录树相对应的条目的目录表。 与命名空间集中的命名空间相对应的每个节点都被标记为包含。 对于每个文件,文件系统元数据的第二次扫描是通过访问目录表来确定该文件是否在所包含的目录中或之下。 对于位于或位于所包含的目录中的每个文件,文件信息将返回引擎。 引擎可以请求扫描仪提供完整路径信息,扫描仪通过目录表确定。
    • 6. 发明申请
    • Generating storage reports using volume snapshots
    • 使用卷快照生成存储报告
    • US20060235892A1
    • 2006-10-19
    • US11107119
    • 2005-04-15
    • Ran KalachJames BentonPaul Oltean
    • Ran KalachJames BentonPaul Oltean
    • G06F17/30
    • G06F11/3409G06F11/3485Y10S707/99953Y10S707/99954
    • Described is a method and system by which storage reports are generated from a volume snapshot set rather than the live volume or volumes, wherein a volume snapshot set comprises a representation or copy of one or more 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.
    • 描述了一种通过其从卷快照集而不是实际卷或卷生成存储报告的方法和系统,其中卷快照集合包括在单个时间点的一个或多个卷的表示或副本。 通过扫描快照,获得一致的文件系统映像。 可以通过枚举卷的文件目录,或者在可用时通过访问单独维护在卷上的文件信息(例如,主文件表)的文件系统元数据来进行扫描。 利用一些(例如基于硬件的)快照技术,快照可以被传送到另一个计算系统,以便由其他计算系统进行扫描,从而避免在扫描时负担现场系统的资源。 因此,在单个时间点上获得了准确和一致的存储报告,与被扫描的卷数无关。
    • 8. 发明授权
    • Registering and storing dependencies among applications and objects in a computer system and communicating the dependencies to a recovery or backup service
    • 在计算机系统中注册和存储应用程序和对象之间的依赖关系,并将依赖关系传达到恢复或备份服务
    • US07363633B1
    • 2008-04-22
    • US09557250
    • 2000-04-24
    • Jonathan S. GoldickLuis Felipe CabreraPaul Oltean
    • Jonathan S. GoldickLuis Felipe CabreraPaul Oltean
    • G06F3/00G06F12/00G06F9/44G06F15/16
    • G06F11/1448G06F11/1469G06F2201/82G06F2201/84Y10S707/99953
    • An application programming interface protocol is provided for making requests to registered applications regarding applications' dependency information so that a table of dependency information relating to a target object can be recursively generated. When all of the applications' dependencies are captured at the same time for given volume(s) or object(s), the entire volume's or object's program and data dependency information may be maintained for the given time. With this dependency information, the computer system advantageously knows not only which files and in which order to freeze or flush files in connection with a backup, such as a snapshot, or restore of given volume(s) or object(s), but also knows which volume(s) or object(s) can be excluded from the freezing process. After a request by a service for application dependency information, the computer system can translate or process dependency information, thereby ordering recovery events over a given set of volumes or objects.
    • 提供了一种应用程序编程接口协议,用于向注册的应用程序提出关于应用程序的依赖关系信息的请求,从而可以递归地生成与目标对象相关的依赖关系信息表。 当给定的卷或对象同时捕获所有应用程序的依赖关系时,可以在给定时间内维护整个卷或对象的程序和数据依赖关系信息。 利用这种依赖性信息,计算机系统不仅有利地知道哪些文件和以什么顺序冻结或刷新与备份有关的文件,例如快照,还是给定卷或对象的恢复,还可以知道 知道哪些卷或物体可以从冻结过程中排除。 在由应用程序依赖关系信息的服务请求之后,计算机系统可以翻译或处理依赖关系信息,从而通过给定的一组卷或对象排序恢复事件。