Minimizing data volume growth under encryption changes

    公开(公告)号:US11907162B2

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

    申请号:US17333484

    申请日:2021-05-28

    申请人: SAP SE

    IPC分类号: G06F16/11 H04L9/08 G06F21/60

    摘要: Computer-readable media, methods, and systems are disclosed for minimizing data volume growth in a database system under changes to an encryption status of a plurality of data pages persisted to a database. Initially, a request is received to update an encryption parameter associated with the database. Next, it is determined whether a candidate page requires encryption changes. In response to determining that the candidate page is not currently in use by one or more active database snapshots and not currently loaded in main memory, the candidate page is loaded into main memory. Next, an encryption operation is performed on the candidate page, and the encrypted page is designated for persistence. Finally, based on a current number of candidate pages already encrypted during a current save point cycle, the selective iteration is paused until a subsequent save point cycle.

    Backup operations in a tree-based distributed file system

    公开(公告)号:US11892995B2

    公开(公告)日:2024-02-06

    申请号:US17475060

    申请日:2021-09-14

    申请人: Cohesity, Inc.

    摘要: 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 in 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.