Granted Patent B2

US 12,499,106 · App. 18/591,615 · Granted Dec 16, 2025

Inventors: Erez Webman (Petach Tikva, IL); Irit Yadin-Lempel (Caesarea, IL)

Assignee: Regatta Data Ltd.

G06F16/2379G06F16/2315G06F16/2336

Abstract

Claims (38)

1 . A local database system, comprising:

a single node connected through a network to a client, wherein the local database system operates with the node as a non-distributed arrangement; wherein the node comprises:

a storage for storing a plurality of data cells;

one or more processors embedded within the node; and

a memory, the memory containing instructions that, when executed by the one or more processors, configure the node to:

receive at least one non-commit statement that is part of a transaction, wherein the transaction is initiated by the client to be executed on a database system;

execute tasks included in each of the at least one received statement in an optimistic manner allowing statements of other transactions to independently access same data cells in the database system being modified by tasks of the at least one received statement, wherein a task is a read operation, and the node is configured to:

receive a pointer to a data cell in the storage to be read;

add the data cell to a read vector;

determine whether there is at least one write operation dependent on the read operation, wherein a dependent write operation is executed by a transaction different from the transaction initiated by the client; and

for each dependent write operation having a commit pause placed on the data cell to be read, waiting for the commit pause to be released; and

return the client an acknowledgment that the transaction is committed, wherein the acknowledgment is returned upon validation of the transaction, wherein the transaction is validated in a pessimistic manner.

2 . The system of claim 1 , wherein the one or more processors are further configured to:

instantiate one agent configured to read operations and write operations commanded by the execution of the tasks; and

instantiate a transaction manager configured to manage the execution of an entire transaction over the node.

3 . The system of claim 2 , wherein the transaction manager is instantiated for each received transaction.

4 . The system of claim 2 , wherein the one or more processors are further configured to:

determine, by the transaction manager, whether the at least one received statement is a commit statement.

5 . The system of claim 2 , wherein validation of a transaction in a pessimistic manner includes waiting for other transactions to commit.

6 . The system of claim 2 , wherein the transaction includes a collection of statements, each of the least one statement causes the execution of one or more tasks.

7 . The system of claim 2 , wherein the one or more processors are further configured to:

place, by the agent, a dependency between a dependent transaction performing a write operation and the transaction requesting the read operation when there is no commit pause placed on the data cell to be read.

8 . The system of claim 7 , wherein the one or more processors are further configured to:

read contents of the data cell when there are no dependent write operations, wherein a dependency between the read operation and write operation and a commit pause are released over time.

9 . The system of claim 2 , wherein the one or more processors, when the task is a write operation, and the one or more processors are configured to:

receive, by the agent, a pointer to a data cell to write data;

add the data cell to a write vector of the transaction; and

write new contents to the data cell in an uncommitted manner, thereby allowing original contents of the data cell and the new contents to co-reside.

10 . The system of claim 2 , wherein the one or more processors are further configured to:

cause, by the agent, a validation of each write operation performed during execution of the received transaction.

11 . The system of claim 10 , wherein the one or more processors are further configured to:

place a commit pause on any data cell modified by each of the write operation;

scan a write vector of the transaction to identify data cells modified by each of the write operations;

for each identified data cells, identify conflicting read operations, wherein a conflicting read operation is a read operation of a transaction different from the transaction; and

place a dependency between the transaction and a transaction executing the conflicting read operation.

12 . The system of claim 11 , wherein the one or more processors are further configured to:

wait until dependencies between the transaction and conflicting read operation are released; and

return a validation acknowledgement.

Assignments (1)

Continuity (2)

References Cited (36)