Concurrent access and transactions in a distributed file system

    公开(公告)号:US10275469B2

    公开(公告)日:2019-04-30

    申请号:US15628484

    申请日:2017-06-20

    Applicant: Cohesity, Inc.

    Abstract: Embodiments described herein provide techniques for maintaining consistency in a distributed system (e.g., a distributed secondary storage system). According to one embodiment of the present disclosure, a first set of file system objects included in performing the requested file system operation is identified in response to a request to perform a file system operation. An update intent corresponding to the requested file system operation is inserted into an inode associated with each identified file system object. Each file system object corresponding to the inode is modified as specified by the update intent in that inode. After modifying the file system object corresponding to the inode, the update intent is removed from that inode.

    BACKUP OPERATIONS IN A TREE-BASED DISTRIBUTED FILE SYSTEM

    公开(公告)号:US20170344590A1

    公开(公告)日:2017-11-30

    申请号:US15632121

    申请日:2017-06-23

    Applicant: Cohesity, Inc.

    Abstract: Techniques for cloning, writing to, and reading from file system metadata. Cloning involves identifying a first set of pointers included in a first root node in a file system metadata tree structure that stores file system metadata n leaf nodes of the tree structure, creating a first copy of the first root node that includes the first set of pointers, creating a second copy of the first root node that includes the first set of pointers, associating the first copy with a first view, and associating the second copy with a second view. Reading generally involves traversing the tree structure towards a target leaf node that contains data to be read. Writing generally involves traversing the tree structure n the same manner, but also creating copies of any nodes to be modified if those nodes are deemed to have a different treeID than a particular root node.

    Reducing memory usage in storing metadata

    公开(公告)号:US12164799B2

    公开(公告)日:2024-12-10

    申请号:US18239004

    申请日:2023-08-28

    Applicant: Cohesity, Inc.

    Abstract: Data associated with a source system is ingested. After the data is ingested, a post-processing metadata conversion process is performed including by selecting an entry of a chunk metadata data structure and determining that a data chunk associated with the selected entry is not referenced by at least a threshold number of objects. In response to determining that the data chunk associated with the selected entry is not referenced by at least the threshold number of objects, metadata of a tree data structure node corresponding to a chunk identifier associated with the data chunk is updated to store a reference to a chunk file storing the data chunk and the selected entry is removed from the chunk metadata data structure.

    Large content file optimization
    34.
    发明授权

    公开(公告)号:US12164386B2

    公开(公告)日:2024-12-10

    申请号:US18197491

    申请日:2023-05-15

    Applicant: Cohesity, Inc.

    Abstract: A plurality of portions of a content file are stored. It is determined that the content file has a size that is greater than a threshold size. In response to determining that the content file has the size that is greater than the threshold size, a plurality of component file metadata structures are generated for each of the plurality of portions of the content file. A component file metadata structure of the plurality of component file metadata structures corresponds to one of the portions of the content file. Each of the plurality of component file metadata structures includes corresponding metadata that enables data chunks associated with a corresponding portion of the content file to be located.

    DATA RETRIEVAL USING EMBEDDINGS FOR DATA IN BACKUP SYSTEMS

    公开(公告)号:US20240370339A1

    公开(公告)日:2024-11-07

    申请号:US18618695

    申请日:2024-03-27

    Applicant: Cohesity, Inc.

    Abstract: In general, techniques for efficient data retrieval from a backup system are described. An example computing system includes one or more storage devices and processing circuitry having access to the one or more storage devices and configured to: process an input to generate a filter, wherein the input indicates a context for one or more queries; apply the filter to backup data to obtain filtered data from the backup data; generate an index of embeddings from the filtered data; process, based on the index of embeddings, a query to generate a response for the query; and output the response.

    REDUCING MEMORY USAGE IN STORING METADATA
    36.
    发明公开

    公开(公告)号:US20230401003A1

    公开(公告)日:2023-12-14

    申请号:US18239004

    申请日:2023-08-28

    Applicant: Cohesity, Inc.

    CPC classification number: G06F3/0655 G06F3/0679 G06F3/0608 G06F3/0652

    Abstract: Data associated with a source system is ingested. After the data is ingested, a post-processing metadata conversion process is performed including by selecting an entry of a chunk metadata data structure and determining that a data chunk associated with the selected entry is not referenced by at least a threshold number of objects. In response to determining that the data chunk associated with the selected entry is not referenced by at least the threshold number of objects, metadata of a tree data structure node corresponding to a chunk identifier associated with the data chunk is updated to store a reference to a chunk file storing the data chunk and the selected entry is removed from the chunk metadata data structure.

    Tier-optimized write scheme
    38.
    发明授权

    公开(公告)号:US11733871B2

    公开(公告)日:2023-08-22

    申请号:US16662899

    申请日:2019-10-24

    Applicant: Cohesity, Inc.

    Abstract: A request to write data corresponding to at least a first portion of a file is received. It is determined whether to perform the request either as an in-place write or as an out-of-place write. Performing the in-place write comprises performing a write to a low latency storage device, and performing the out-of-place write comprises performing a write to a higher latency storage device. The request is performed as either the in-place write or the out-of-place write based on the determination. Performing the request as the in-place write includes writing the data to a first location on a storage tier storing the first portion of the file, and performing the request as the out-of-place write includes writing the data to a second location on one of a plurality of storage tiers of a computing node, other than the first location.

    Concurrent access and transactions in a distributed file system

    公开(公告)号:US11687494B2

    公开(公告)日:2023-06-27

    申请号:US16921055

    申请日:2020-07-06

    Applicant: Cohesity, Inc.

    CPC classification number: G06F16/1767 G06F16/9024

    Abstract: Embodiments described herein provide techniques for maintaining consistency in a distributed system (e.g., a distributed secondary storage system). According to one embodiment of the present disclosure, a first set of file system objects included in performing the requested file system operation is identified in response to a request to perform a file system operation. An update intent corresponding to the requested file system operation is inserted into an inode associated with each identified file system object. Each file system object corresponding to the inode is modified as specified by the update intent in that inode. After modifying the file system object corresponding to the inode, the update intent is removed from that inode.

    BACKUP OPERATIONS IN A TREE-BASED DISTRIBUTED FILE SYSTEM

    公开(公告)号:US20210406238A1

    公开(公告)日:2021-12-30

    申请号:US17475060

    申请日:2021-09-14

    Applicant: Cohesity, Inc.

    Abstract: Techniques for cloning, writing to, and reading from file system metadata. Cloning involves identifying a first set of pointers included h a first root node in a file system metadata tree structure that stores file system metadata n leaf nodes of the tree structure, creating a first copy of the first root node that includes the first set of pointers, creating a second copy of the first root node that includes the first set of pointers, associating the first copy with a first view, and associating the second copy with a second view. Reading generally involves traversing the tree structure towards a target leaf node that contains data to be read. Writing generally involves traversing the tree structure n the same manner, but also creating copies of any nodes to be modified if those nodes are deemed to have a different treeID than a particular root node.

Patent Agency Ranking