OPTIMIZING SNAPSHOT IMAGE PROCESSING

    公开(公告)号:US20230013846A1

    公开(公告)日:2023-01-19

    申请号:US17879720

    申请日:2022-08-02

    Applicant: Rubrik, Inc.

    Abstract: Systems, methods, and machine-storage mediums for optimizing snapshot image processing are described. The system receives a first read request to read data from optimized snapshot information including snapshot information and cached snapshot information. The first read request includes a first offset identifying a first storage location and a first length. The snapshot information includes a full snapshot and at least one incremental snapshot. The system identifies a first portion of the data is stored in the snapshot information responsive to identifying the first portion of the data is not stored in the cache snapshot information. The system identifies a second portion of data is stored in the optimized snapshot information, reads the first portion of data and the second portion of data from the optimized snapshot information, and communicates the data, including the first and second portions of the data, to the job.

    Chunk allocation
    3.
    发明授权

    公开(公告)号:US10339016B2

    公开(公告)日:2019-07-02

    申请号:US15674362

    申请日:2017-08-10

    Applicant: RUBRIK, INC.

    Abstract: Methods and systems for identifying a set of disks within a cluster and then storing a plurality of data chunks into the set of disks such that the placement of the plurality of data chunks within the cluster optimizes failure tolerance and storage system performance for the cluster are described. The plurality of data chunks may be generated using replication of data (e.g., n-way mirroring) or application of erasure coding to the data (e.g., using a Reed-Solomon code or a Low-Density Parity-Check code). The topology of the cluster including the physical arrangement of the nodes and disks within the cluster and status information for the nodes and disks within the cluster (e.g., information regarding disk fullness, disk performance, and disk age) may be used to identify the set of disks in which to store the plurality of data chunks.

    TECHNIQUES FOR FAST IO AND LOW MEMORY CONSUMPTION WHILE USING ERASURE CODES

    公开(公告)号:US20190181887A1

    公开(公告)日:2019-06-13

    申请号:US15838078

    申请日:2017-12-11

    Applicant: RUBRIK, INC.

    Abstract: Methods and systems for improving the read and write performance of a distributed file system while limiting memory usage are described. The type of error correcting scheme applied to data, the partitioning of the data into data chunks, and the sizes of data slices within each of the data chunks used for storing electronic files within the distributed file system may be dynamically adjusted over time to optimize for fast IO performance while limiting memory usage (e.g., requiring less than 256 MB of RAM to generate and store code blocks). The file size of an electronic file to be stored, the amount of available memory for generating code blocks, and the amount of available disk space to store the electronic file may be used to set the data sizes of the data slices and the type of erasure code applied to data blocks associated with the data slices.

    Optimizing snapshot image processing

    公开(公告)号:US11422897B2

    公开(公告)日:2022-08-23

    申请号:US16528337

    申请日:2019-07-31

    Applicant: Rubrik, Inc.

    Abstract: Systems, methods, and machine-storage mediums for optimizing snapshot image processing are described. The system receives a first read request to read data from optimized snapshot information including snapshot information and cached snapshot information. The first read request includes a first offset identifying a first storage location and a first length. The snapshot information includes a full snapshot and at least one incremental snapshot. The system identifies a first portion of the data is stored in the snapshot information responsive to identifying the first portion of the data is not stored in the cache snapshot information. The system identifies a second portion of data is stored in the optimized snapshot information, reads the first portion of data and the second portion of data from the optimized snapshot information, and communicates the data, including the first and second portions of the data, to the job.

    CHUNK ALLOCATION
    7.
    发明申请
    CHUNK ALLOCATION 审中-公开

    公开(公告)号:US20200057699A1

    公开(公告)日:2020-02-20

    申请号:US16569008

    申请日:2019-09-12

    Applicant: Rubrik, Inc.

    Abstract: Methods and systems for identifying a set of disks within a cluster and then storing a plurality of data chunks into the set of disks such that the placement of the plurality of data chunks within the cluster optimizes failure tolerance and storage system performance for the cluster are described. The plurality of data chunks may be generated using replication of data (e.g., n-way mirroring) or application of erasure coding to the data (e.g., using a Reed-Solomon code or a Low-Density Parity-Check code). The topology of the cluster including the physical arrangement of the nodes and disks within the cluster and status information for the nodes and disks within the cluster (e.g., information regarding disk fullness, disk performance, and disk age) may be used to identify the set of disks in which to store the plurality of data chunks.

    Chunk allocation
    8.
    发明授权

    公开(公告)号:US10423503B2

    公开(公告)日:2019-09-24

    申请号:US15802792

    申请日:2017-11-03

    Applicant: RUBRIK, INC.

    Abstract: Methods and systems for identifying a set of disks within a cluster and then storing a plurality of data chunks into the set of disks such that the placement of the plurality of data chunks within the cluster optimizes failure tolerance and storage system performance for the cluster are described. The plurality of data chunks may be generated using replication of data (e.g., n-way mirroring) or application of erasure coding to the data (e.g., using a Reed-Solomon code or a Low-Density Parity-Check code). The topology of the cluster including the physical arrangement of the nodes and disks within the cluster and status information for the nodes and disks within the cluster (e.g., information regarding disk fullness, disk performance, and disk age) may be used to identify the set of disks in which to store the plurality of data chunks.

    CHUNK ALLOCATION
    9.
    发明申请
    CHUNK ALLOCATION 审中-公开

    公开(公告)号:US20190050301A1

    公开(公告)日:2019-02-14

    申请号:US15674362

    申请日:2017-08-10

    Applicant: RUBRIK, INC.

    Abstract: Methods and systems for identifying a set of disks within a cluster and then storing a plurality of data chunks into the set of disks such that the placement of the plurality of data chunks within the cluster optimizes failure tolerance and storage system performance for the cluster are described. The plurality of data chunks may be generated using replication of data (e.g., n-way mirroring) or application of erasure coding to the data (e.g., using a Reed-Solomon code or a Low-Density Parity-Check code). The topology of the cluster including the physical arrangement of the nodes and disks within the cluster and status information for the nodes and disks within the cluster (e.g., information regarding disk fullness, disk performance, and disk age) may be used to identify the set of disks in which to store the plurality of data chunks.

    AGGREGATION OF POLICY INFORMATION FOR PRINCIPALS ASSOCIATED WITH A FILE SYSTEM

    公开(公告)号:US20250148121A1

    公开(公告)日:2025-05-08

    申请号:US18502625

    申请日:2023-11-06

    Applicant: Rubrik, Inc.

    Abstract: Methods, systems, and devices for data management are described. A data management system (DMS) may obtain a snapshot of a file system that includes multiple files and permission sets associated with the files. A permission set may indicate one or more access approvals for associated principals. The DMS may scan the files to identify unique pairs each including a unique combination of a respective permission set and a respective sensitive information type. The DMS may store a first mapping that maps the unique pairs to respective values that indicate an amount of sensitive information, of the respective sensitive information type, that is included in one or more files associated with the unique pair. The DMS may identify a respective set of sensitive data types included in files to which a principal has access based on the first mapping and an evaluation of the permission sets.

Patent Agency Ranking