公开(公告)号：US11321300B2

公开(公告)日：2022-05-03

申请号：US16596144

申请日：2019-10-08

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Yuk Kuen Chan ,  Huaxin Zhang ,  Wenbin Ma ,  Hoi leng Lao

IPC: G06F16/23 ,  G06F16/27

Abstract: The disclosed systems, structures, and methods are directed towards for processing a lock request by a master node to access a shared data object in a database located at a remote location comprising identifying, in the master node, a category of the lock request. If the lock request is for a self-compatible lock, determining a value of a counter associated with the master node and with one or more other master nodes, and if the value of the counter is zero, locally granting the lock request. If the value of the counter is greater than zero, forwarding the lock request to a global lock manager (GLM), and if the lock request is for a heavy-conflicting lock, forwarding the lock request by the master node to the GLM.

公开(公告)号：US11520747B2

公开(公告)日：2022-12-06

申请号：US16700459

申请日：2019-12-02

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Yuk Kuen Chan ,  Wenbin Ma ,  Emad Boctor ,  Huaxin Zhang

IPC: G06F16/178 ,  G06F16/18 ,  G06F16/22 ,  G06F16/23 ,  G06F9/54

Abstract: The disclosed systems and methods are directed for detecting and resolving write-write conflicts among a plurality of transactions received from master nodes of a multi-writer database system. The method includes receiving a plurality of REDO logs and storing the plurality of REDO logs in a buffer, each REDO log associated with the one of the plurality of transactions, selecting one REDO log of the plurality of REDO logs; persisting the transaction associated with the one REDO log in a local storage when a write-write conflict is detected between the one REDO log and at least one other REDO log of the plurality of REDO logs prior to committing the transaction associated with the one REDO log; and transmitting a status of the transaction associated with the one REDO log to a global transaction manager (GTM).

公开(公告)号：US11954091B2

公开(公告)日：2024-04-09

申请号：US17587564

申请日：2022-01-28

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Wenbin Ma ,  Huaxin Zhang ,  Yuk Kuen Chan

IPC: G06F16/23 ,  G06F11/07 ,  G06F16/22 ,  G06F16/27

CPC classification number: G06F16/2365 ,  G06F11/0709 ,  G06F16/2246 ,  G06F16/278

Abstract: Methods and apparatus are described for splitting a page (or node) in an index tree database index for a multi-master database. The methods include creating a first split page of a first page. The first page belongs to a first set of pages and comprises a hinge page. The hinge page also belongs to a second set of pages. Updating the first set of pages may cause the hinge page itself to split, creating a split of the hinge page. The second set of pages is updated in response to creating the split of the hinge page. Described are techniques whereby the updates to the first and second sets of pages are atomic, that is, they all succeed or they all fail, which may realize any of several benefits.

公开(公告)号：US11995069B2

公开(公告)日：2024-05-28

申请号：US17851892

申请日：2022-06-28

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Huaxin Zhang ,  Ronen Grosman ,  Rongzhen Cui

IPC: G06F16/00 ,  G06F16/23 ,  G06F16/27

CPC classification number: G06F16/2379 ,  G06F16/27

Abstract: A system and method for an online transaction system to transition from operating under a first mode (FM) to operating under a second mode (SM), and vice versa. In the FM, transaction nodes identify transactions with sequential numbers obtained from a global transaction server (GTS). In the SM, transaction nodes identify consecutive transactions with timestamps based on global clock servers (GCSs). When transitioning from one mode to the other mode, a controller instructs the transactions nodes to provide GCS-based transaction timestamps and error bounds to the GTS, which modifies the timestamps and the error bounds based on previously received timestamps and error bounds, and on the latest transaction number issued by the GTS. Modified timestamps and error bounds are obtained at the transaction nodes. Each transaction is timestamped with its respective modified timestamp. But there is a delay equal to the modified error bound before requesting another modified timestamp.

公开(公告)号：US20240283855A1

公开(公告)日：2024-08-22

申请号：US18111145

申请日：2023-02-17

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Ronen GROSMAN ,  Huaxin Zhang

IPC: H04L69/28

CPC classification number: H04L69/28

Abstract: Method, apparatus and system for assigning a commit sequence number (CSN) to a WRITE transaction in a network having nodes and a global time server. The CSN is defined by a timestamp of the WRITE transaction and an error bound of the timestamp. The WRITE transaction is committed after the timestamp is issued and an amount of time equal to the error bound plus a time adjust value has passed. The time adjust value is based on round-trip times between the plurality of nodes and the global time server. The time adjust value may be the longest expected round-trip time. By waiting for an amount of time equal to the error bound plus the time adjust value, any READ transaction occurring after the WRITE transaction may receive a READ timestamp without any delay, provided the READ timestamp error bound is less than or equal to the time adjust value.

公开(公告)号：US11321354B2

公开(公告)日：2022-05-03

申请号：US16590078

申请日：2019-10-01

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Xun Xue ,  Huaxin Zhang ,  Yuk Kuen Chan ,  Wenbin Ma

IPC: G06F16/27 ,  G06F16/23 ,  G06F11/14 ,  G06F16/174

Abstract: The disclosed computing node comprises a processor and a non-transitory storage medium storing instructions executable by the processor. A method and a system are also disclosed. A subset of a plurality of conventional redo records, corresponding to received write requests, is selected based on an identical data location identifier. The conventional redo records of such selected subset are combined into a consolidated redo record. The consolidated redo record is then transmitted to a target node for processing.