ORACLE INTERNATIONAL CORPORATION (20240281413). TECHNIQUES FOR REPLICATION CHECKPOINTING DURING DISASTER RECOVERY simplified abstract

From WikiPatents
Jump to navigation Jump to search

TECHNIQUES FOR REPLICATION CHECKPOINTING DURING DISASTER RECOVERY

Organization Name

ORACLE INTERNATIONAL CORPORATION

Inventor(s)

Satish Kumar Kashi Visvanathan of San Jose CA (US)

Viggnesh Venugopal of Santa Clara CA (US)

Victor Vladimir Golosovker of Union City CA (US)

Ravi Lingappa Shamanna of Milpitas CA (US)

TECHNIQUES FOR REPLICATION CHECKPOINTING DURING DISASTER RECOVERY - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240281413 titled 'TECHNIQUES FOR REPLICATION CHECKPOINTING DURING DISASTER RECOVERY

Simplified Explanation: The patent application describes techniques for checkpointing multiple key ranges in parallel and concurrently during file storage replications between file systems in different cloud infrastructure regions.

  • Multiple range threads process multiple key ranges, creating checkpoints for their respective key ranges in parallel after processing a predetermined number of B-tree keys.
  • In case of a failure event, each thread restarts its B-tree key processing from a key after the most recent checkpoint.

Key Features and Innovation:

  • Checkpointing multiple key ranges in parallel during file storage replications.
  • Utilizing multiple range threads to process key ranges concurrently.
  • Restarting B-tree key processing from the most recent checkpoint in case of a failure event.

Potential Applications:

  • Cloud storage systems
  • Data replication technologies
  • Distributed file systems

Problems Solved:

  • Efficient checkpointing during file storage replications
  • Handling failure events in key range processing

Benefits:

  • Improved reliability in file storage replications
  • Enhanced efficiency in key range processing
  • Minimized data loss in case of failure events

Commercial Applications: Cloud storage providers can utilize this technology to enhance the reliability and efficiency of their file storage replications, attracting more customers looking for secure and robust cloud solutions.

Questions about Checkpointing Multiple Key Ranges: 1. How does the technology ensure data integrity during checkpointing multiple key ranges? 2. What are the potential scalability challenges when implementing this technology in large-scale cloud infrastructures?


Original Abstract Submitted

techniques are described for checkpointing multiple key ranges in parallel and concurrently during file storage replications between file systems in different cloud infrastructure regions. in certain embodiments, multiple range threads processing multiple key ranges, one thread per key range, create checkpoints for their respective key ranges in parallel and concurrently after processing a per-determined number of b-tree keys. in certain embodiments, upon encountering a failure event, either a system crash or a thread failure, each thread restarts its b-tree key processing from a b-tree key after the most recent checkpoint.