US 12,455,861 B2
Techniques for efficient encryption and decryption during file system cross-region replication
Satish Kumar Kashi Visvanathan, San Jose, CA (US); Viggnesh Venugopal, Santa Clara, CA (US); and Vikram Singh Bisht, Seattle, WA (US)
Assigned to Oracle International Corporation, Redwood Shores, CA (US)
Filed by Oracle International Corporation, Redwood Shores, CA (US)
Filed on Dec. 11, 2023, as Appl. No. 18/536,072.
Application 18/536,072 is a continuation in part of application No. 18/094,302, filed on Jan. 6, 2023, granted, now 12,306,802.
Claims priority of provisional application 63/378,486, filed on Oct. 5, 2022.
Claims priority of provisional application 63/412,243, filed on Sep. 30, 2022.
Claims priority of provisional application 63/357,526, filed on Jun. 30, 2022.
Claims priority of provisional application 63/352,992, filed on Jun. 16, 2022.
Prior Publication US 2024/0134828 A1, Apr. 25, 2024
Int. Cl. G06F 16/185 (2019.01); G06F 16/172 (2019.01); G06F 16/178 (2019.01); G06F 21/60 (2013.01); H04L 9/08 (2006.01); G06F 21/62 (2013.01)
CPC G06F 16/178 (2019.01) [G06F 16/172 (2019.01); G06F 16/185 (2019.01); G06F 21/602 (2013.01); H04L 9/0836 (2013.01); G06F 21/6218 (2013.01); H04L 9/08 (2013.01); H04L 9/0894 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method, comprising:
performing, by a computing system, a first replication between a source file system in a source region and a first target file system in a first target region, the source region comprising one or more connected data centers, and the first target region comprising one or more connected data centers;
arranging, by the computing system, key-value pairs of a binary tree (B-tree) in a particular layout in the source file system, the key-value pairs of the B-tree comprising a first type of information and its associated one or more second type of information, the one or more second type of information being dependent on the first type of information for processing;
partitioning, by the computing system, the key-value pairs of the B-tree into one or more key ranges containing the key-value pairs of the B-tree, each key range of the one or more key ranges comprising a processing thread configured to process at least one key-value pair of the B-tree in parallel during the first replication;
creating, by the computing system, a hierarchy of caches comprising one or more first-level caches and a second-level cache, the one or more first-level caches and the one or more key ranges being configured to have a one-to-one mapping, the second-level cache and the one or more key ranges being configured to have a one-to-many mapping; and
storing, by the computing system, an element of the first type of information in the one or more first-level cache and the second-level cache.