18372005. CONFIGURATION AND MANAGEMENT OF REPLICATION UNITS FOR ASYNCHRONOUS DATABASE TRANSACTION REPLICATION simplified abstract (Oracle International Corporation)

From WikiPatents
Revision as of 06:29, 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 18372005 titled 'CONFIGURATION AND MANAGEMENT OF REPLICATION UNITS FOR ASYNCHRONOUS DATABASE TRANSACTION REPLICATION

Simplified Explanation

The abstract of the patent application describes a consensus protocol-based replication approach that optimizes replication efficiency by grouping chunks into replication units (RUs). These RUs can be split and merged without interrupting concurrent user workload or requiring routing changes. Each RU has a replication factor (RF) and a distribution factor (DF) to manage copies/replicas and workload distribution in case of server failures.

  • Chunks are grouped into replication units (RUs) to optimize replication efficiency.
  • RUs can be split and merged without interrupting user workload or requiring routing changes.
  • Each RU has a replication factor (RF) and a distribution factor (DF) to manage copies and workload distribution.
  • Transactions spanning chunks within an RU do not require distributed transaction processing.
  • RUs may be placed in rings of servers, where the number of servers in a ring equals the replication factor.
      1. Potential Applications

This technology can be applied in distributed systems, cloud computing, and database management to improve replication efficiency and fault tolerance.

      1. Problems Solved

This technology solves the problem of optimizing replication efficiency without interrupting user workload or requiring complex routing changes.

      1. Benefits

The benefits of this technology include improved replication efficiency, fault tolerance, and simplified management of replication units.

      1. Potential Commercial Applications

Potential commercial applications of this technology include cloud service providers, database management companies, and distributed system developers.

      1. Possible Prior Art

One possible prior art could be the use of consensus protocols in distributed systems for replication and fault tolerance.

    1. Unanswered Questions
      1. How does this technology handle dynamic changes in workload distribution?

The patent application does not provide specific details on how the technology adapts to dynamic changes in workload distribution within replication units.

      1. What impact does the replication factor have on overall system performance?

The patent application does not discuss the potential trade-offs or performance implications of different replication factors on the overall system performance.


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.