Oracle international corporation (20240126782). CONFIGURATION AND MANAGEMENT OF REPLICATION UNITS FOR ASYNCHRONOUS DATABASE TRANSACTION REPLICATION simplified abstract

From WikiPatents
Revision as of 03:05, 26 April 2024 by Wikipatents (talk | contribs) (Creating a new page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

CONFIGURATION AND MANAGEMENT OF REPLICATION UNITS FOR ASYNCHRONOUS DATABASE TRANSACTION REPLICATION

Organization Name

oracle international corporation

Inventor(s)

Lik Wong of Palo Alto CA (US)

Leonid Novak of Castro Valley CA (US)

Sampanna Salunke of San Carlos CA (US)

Mark Dilman of Sunnyvale CA (US)

Wei-Ming Hu of Palo Alto CA (US)

CONFIGURATION AND MANAGEMENT OF REPLICATION UNITS FOR ASYNCHRONOUS DATABASE TRANSACTION REPLICATION - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240126782 titled 'CONFIGURATION AND MANAGEMENT OF REPLICATION UNITS FOR ASYNCHRONOUS DATABASE TRANSACTION REPLICATION

Simplified Explanation

A consensus protocol-based replication approach is provided in this patent application. Chunks are grouped into replication units (RUs) to optimize replication efficiency. Chunks may be assigned to RUs based on load and replication throughput. Splitting and merging RUs do not interrupt concurrent user workload or require routing changes. Transactions spanning chunks within an RU do not require distributed transaction processing. Each replication unit has a replication factor (RF) and an associated distribution factor (DF). RUs may be placed in rings of servers, where the number of servers in a ring is equal to the replication factor, and quiescing the workload can be restricted to a ring of servers instead of the entire database.

  • Consensus protocol-based replication approach
  • Grouping chunks into replication units (RUs)
  • Assignment of chunks to RUs based on load and replication throughput
  • Splitting and merging RUs without interrupting user workload
  • Transactions spanning chunks within an RU do not require distributed transaction processing
  • Replication factor (RF) and distribution factor (DF) for each RU
  • Placing RUs in rings of servers for efficient replication
  • Quiescing workload on a ring of servers instead of the entire database

Potential Applications

The technology described in this patent application could be applied in distributed databases, cloud computing systems, and large-scale data storage solutions.

Problems Solved

This technology solves the problem of optimizing replication efficiency, reducing interruptions to user workload during replication operations, and simplifying transaction processing in distributed systems.

Benefits

The benefits of this technology include improved replication performance, enhanced scalability, reduced complexity in managing distributed systems, and increased fault tolerance.

Potential Commercial Applications

A potential commercial application of this technology could be in providing high-performance and reliable data replication services for enterprise cloud computing environments.

Possible Prior Art

One possible prior art for this technology could be the use of consistent hashing algorithms in distributed systems to optimize data replication and load balancing.

Unanswered Questions

How does this technology compare to existing replication approaches in terms of performance and scalability?

This article does not provide a direct comparison with existing replication approaches in terms of performance and scalability.

What are the potential challenges or limitations of implementing this technology in real-world distributed systems?

This article does not address the potential challenges or limitations of implementing this technology in real-world distributed systems.


Original Abstract Submitted

a consensus protocol-based replication approach is provided. chunks are grouped into replication units (rus) to optimize replication efficiency. chunks may be assigned to rus based on load and replication throughput. splitting and merging rus do not interrupt concurrent user workload or require routing changes. transactions spanning chunks within an ru do not require distributed transaction processing. each replication unit has a replication factor (rf), which refers to the number of copies/replicas of the replication unit, and an associated distribution factor (df), which refers to the number of servers taking over the workload from a failed leader server. rus may be placed in rings of servers, where the number of servers in a ring is equal to the replication factor, and quiescing the workload can be restricted to a ring of servers instead of the entire database.