# US 2025/0165460 A1 · Techniques for protective validation in a non-distributed database

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0165460 A1
- Document ID: US20250165460A1
- Status: Published application
- Kind: A1
- Application number: 18/945,062
- Filed: 2024-11-12
- Published: 2025-05-22
- Earliest claimed: 2023-11-17
- Assignees: Regatta Data Ltd.
- Applicants: Regatta Data Ltd.
- Inventors: Erez WEBMAN; Irit YADIN-LEMPEL; Nitzan ZAMIR; Roy Zeev GOLDSTEIN
- Web page: https://patentgrep.com/patent/US20250165460A1

## CPC

- G06F 16/2336: {Pessimistic concurrency control approaches, e.g. locking or multiple versions without time stamps}
- G06F 16/2315: {Optimistic concurrency control}
- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06F 16/27: Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system and method for managing execution of database transactions in a non-distributed database system is presented. The method includes, during a validation of a transaction, identifying conditional conflicts and their corresponding conflicting transactions, wherein the corresponding conflicting transactions are reading-transactions conflicting with the transaction; for each conditional conflict, determining if the transaction can commit, with respect to the conditional conflict, before the corresponding conflicting transaction; placing an active protective declaration, issued by the transaction and sourced by a corresponding conflicting transaction, when the transaction can commit, with respect to the conditional conflict, before the corresponding conflicting transaction; marking the transaction as dependent on the corresponding conflicting transaction when the transaction cannot commit before the corresponding conflicting transaction; and when validation conditions are met, placing a commit pause on data cells modified by the transaction, thereby allowing the transaction to commit before any corresponding conflicting transactions.

## Claims

### Claim 1

A method for managing execution of database transactions in a non-distributed database system, comprising:
during a validation of a transaction, identifying conditional conflicts and their corresponding conflicting transactions, wherein the corresponding conflicting transactions are reading-transactions conflicting with the transaction;
for each conditional conflict, determining if the transaction can commit, with respect to the conditional conflict, before the corresponding conflicting transaction;
placing an active protective declaration, issued by the transaction and sourced by a corresponding conflicting transaction, when the transaction can commit, with respect to the conditional conflict, before the corresponding conflicting transaction;
marking the transaction as dependent on the corresponding conflicting transaction when the transaction cannot commit before the corresponding conflicting transaction; and
when validation conditions are met, placing a commit pause on data cells modified by the transaction, thereby allowing the transaction to commit before any corresponding conflicting transactions.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
identifying non-conditional conflicts and their related conflicting transactions.

### Claim 3 (depends on 2)

The method of claim 2, wherein the validation conditions include: the transaction is neither conditionally dependent nor non-conditionally dependent on any conflicting transactions; all non-conditional conflicts are processed; all conditional conflicts are processed; the transaction does not have any evaluation-pending validations or evaluation-deferred validations; and any active protective declarations issued by the transaction are not in use by a challenging process.

### Claim 4 (depends on 2)

The method of claim 2, further comprising:
waiting until the validation conditions are met.

### Claim 5 (depends on 2)

The method of claim 2, further comprising:
processing all non-conditional conflicts.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
for each non-conditional conflict, marking the transaction as dependent on the corresponding conflicting transaction; and
removing any protective declarations issued by the transaction that were sourced by the corresponding conflicting transaction.

### Claim 7 (depends on 2)

The method of claim 2, further comprising:
processing all conditional conflicts.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
checking if an epsilon checking procedure can be performed;
when the epsilon checking procedure can be performed:
performing an epsilon checking procedure on the transaction to determine if an epsilon principle is satisfied, wherein the epsilon checking procedure evaluates a value of a predicate on a data-cell set immediately before and immediately after committing the transaction;
issuing the active protective declaration for a specific predicate of a data-cell set, when the epsilon principle is satisfied; and
issuing an inactive conditionally-dependent protective declaration for a specific predicate on a specific data-cell set, when the epsilon principle is not satisfied.

### Claim 9 (depends on 8)

The method of claim 8, further comprising:
when the epsilon checking procedure cannot be performed:
issuing an inactive evaluation-pending protective declaration, sourced by the conflicting transaction, wherein the inactive evaluation-pending protective declaration is issued for a specific predicate on a specific data-cell-set.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
committing the transaction immediately after placing the commit pause on data cells modified by the transaction.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
releasing the commit pause;
removing non-conditional dependencies of other transactions on the transaction;
removing all the active protective declarations issued by the transaction; and
removing all protective declarations sourced by the transaction.

### Claim 12 (depends on 1)

The method of claim 1, wherein the corresponding conflicting transaction is a reading-transaction, and wherein reading data cells by the reading-transaction further comprises:
creating a read vector entry in a read-vector of the reading-transaction;
scanning write vectors of other pending transactions to identify conflicting writing-transactions;
for each identified conflicting writing-transactions, sending a validation message to the conflicting writing-transaction; and
reading the data cells by the reading-transaction.

### Claim 13 (depends on 1)

The method of claim 1, wherein a conditional conflict is determined based, in part, on at least one predicate in the corresponding conflicting transaction.

### Claim 14 (depends on 13)

The method of claim 13, wherein a state of a conditional conflict is determined as a stay-in state when evaluated values of the at least one predicate on a data cell set immediately before and immediately after committing the transaction are a Boolean value true, wherein the stay-in state provides that there is no potential dependency between the transaction and the corresponding conflicting transaction with respect to the conditional conflict.

### Claim 15 (depends on 13)

The method of claim 13, wherein a state of a conditional conflict is determined as a stay-out state when evaluated values of the at least one predicate on a data cell set immediately before and immediately after committing the transaction is a Boolean value false, wherein the stay-out state provides that there is no potential dependency between the transaction and the corresponding conflicting transaction with respect to the conditional conflict.

### Claim 16 (depends on 13)

The method of claim 13, wherein a state of a conditional conflict is determined as a move-in state when evaluated values of the at least one predicate on a data cell set immediately before committing the transaction is a Boolean value false, and the evaluated value of the predicate immediately after committing the transaction is a Boolean value true, wherein the move-in state does not allow the transaction to commit before the corresponding conflicting transaction.

### Claim 17 (depends on 13)

The method of claim 13, wherein a state of a conditional conflict is determined as a move-out state when evaluated values of the at least one predicate on a data cell set immediately before committing the transaction is a Boolean value true, and the evaluated value of the predicate immediately after committing the transaction is a Boolean value false, wherein the move-out state does not allow the transaction to commit before the corresponding conflicting transaction.

### Claim 18 (depends on 1)

The method of claim 1, wherein tasks in the transaction are executed in an optimistic manner, and wherein the transaction is validated in a pessimistic manner.

### Claim 19 (depends on 1)

The method of claim 1, further comprising:
resolving pseudo-deadlocks by applying a forced challenging procedure.

### Claim 20

A non-transitory computer-readable medium storing a set of instructions for managing execution of database transactions in a non-distributed database system, the set of instructions comprising:
one or more instructions that, when executed by one or more processors of a device, cause the device to:
during a validation of a transaction, identify conditional conflicts and their corresponding conflicting transactions, wherein the corresponding conflicting transactions are reading-transactions conflicting with the transaction;
for each conditional conflict, determine if the transaction can commit, with respect to the conditional conflict, before the corresponding conflicting transaction;
place an active protective declaration, issued by the transaction and sourced by a corresponding conflicting transaction, when the transaction can commit, with respect to the conditional conflict, before the corresponding conflicting transaction;
marking the transaction as dependent on the corresponding conflicting transaction when the transaction cannot commit before the corresponding conflicting transaction; and
when validation conditions are met, place a commit pause on data cells modified by the transaction, thereby allowing the transaction to commit before any corresponding conflicting transactions.

### Claim 21

A system for managing execution of database transactions in a non-distributed database system comprising:
one or more processors configured to:
during a validation of a transaction, identify conditional conflicts and their corresponding conflicting transactions, wherein the corresponding conflicting transactions are reading-transactions conflicting with the transaction;
for each conditional conflict, determine if the transaction can commit, with respect to the conditional conflict, before the corresponding conflicting transaction;
place an active protective declaration, issued by the transaction and sourced by a corresponding conflicting transaction, when the transaction can commit, with respect to the conditional conflict, before the corresponding conflicting transaction;
mark the transaction as dependent on the corresponding conflicting transaction when the transaction cannot commit before the corresponding conflicting transaction; and
when validation conditions are met, place a commit pause on data cells modified by the transaction, thereby allowing the transaction to commit before any corresponding conflicting transactions.

### Claim 22 (depends on 21)

The system of claim 21, wherein the one or more processors are further configured to:
identify non-conditional conflicts and their related conflicting transactions.

### Claim 23 (depends on 22)

The system of claim 22, wherein the validation conditions include: the transaction is neither conditionally dependent nor non-conditionally dependent on any conflicting transactions; all non-conditional conflicts are processed; all conditional conflicts are processed; the transaction does not have any evaluation-pending validations or evaluation-deferred validations; and any active protective declarations issued by the transaction are not in use by a challenging process.

### Claim 24 (depends on 22)

The system of claim 22, wherein the one or more processors are further configured to:
wait until the validation conditions are met.

### Claim 25 (depends on 22)

The system of claim 22, wherein the one or more processors are further configured to:
process all non-conditional conflicts.

### Claim 26 (depends on 25)

The system of claim 25, wherein the one or more processors are further configured to:
for each non-conditional conflict, mark the transaction as dependent on the corresponding conflicting transaction; and
remove any protective declarations issued by the transaction that were sourced by the corresponding conflicting transaction.

### Claim 27 (depends on 22)

The system of claim 22, wherein the one or more processors are further configured to:
process all conditional conflicts.

### Claim 28 (depends on 27)

The system of claim 27, wherein the one or more processors are further configured to:
check if an epsilon checking procedure can be performed;
when the epsilon check procedure can be performed:
perform an epsilon checking procedure on the transaction to determine if an epsilon principle is satisfied, wherein the epsilon checking procedure evaluates a value of a predicate on a data cell set immediately before and immediately after committing the transaction;
issue the active protective declaration for a specific predicate of a data-cell set, when the epsilon principle is satisfied; and
issue an inactive conditionally-dependent protective declaration for a specific predicate on a specific data-cell set, when the epsilon principle is not satisfied.

### Claim 29 (depends on 28)

The system of claim 28, wherein the one or more processors are further configured to:
when the epsilon check procedure cannot be performed:
issue an inactive evaluation-pending protective declaration, sourced by the conflicting transaction, wherein the inactive evaluation-pending protective declaration is issued for a specific predicate on a specific data-cell-set.

### Claim 30 (depends on 21)

The system of claim 21, wherein the one or more processors are further configured to:
commit the transaction immediately after placing the commit pause on data cells modified by the transaction.

### Claim 31 (depends on 30)

The system of claim 30, wherein the one or more processors are further configured to:
release the commit pause;
remove non-conditional dependencies of other transactions on the transaction;
remove all the active protective declarations issued by the transaction; and
remove all protective declarations sourced by the transaction.

### Claim 32 (depends on 21)

The system of claim 21, wherein the one or more processors, when the corresponding conflicting transaction is a reading-transaction, are further configured to:
create a read vector entry in a read-vector of the reading-transaction;
scan write vectors of other pending transactions to identify conflicting writing transactions;
for each identified conflict writing-transactions, send a validation message to the conflicting writing-transaction; and
read the data cells by the reading-transaction.

### Claim 33 (depends on 21)

The system of claim 21, wherein a conditional conflict is determined based, in part, on at least one predicate in the corresponding conflicting transaction.

### Claim 34 (depends on 33)

The system of claim 33, wherein a state of a conditional conflict is determined as a stay-in state when evaluated values of the at least one predicate on a data cell set immediately before and immediately after committing the transaction are a Boolean value true, the stay-in state provides that there is no potential dependency between the transaction and the corresponding conflicting transaction with respect to the conditional conflict.

### Claim 35 (depends on 33)

The system of claim 33, wherein a state of a conditional conflict is determined as a stay-out state when evaluated values of the at least one predicate on a data cell set immediately before and immediately after committing the transaction is a Boolean value false, the stay-out state provides that there is no potential dependency between the transaction and the corresponding conflicting transaction with respect to the conditional conflict.

### Claim 36 (depends on 33)

The system of claim 33, wherein a state of a conditional conflict is determined as a move-in state when evaluated values of the at least one predicate on a data cell set immediately before committing the transaction is a Boolean value false, and the evaluated value of the predicate immediately after committing the transaction is a Boolean value true, the move-in state does not allow the transaction to commit before the corresponding conflicting transaction.

### Claim 37 (depends on 33)

The system of claim 33, wherein a state of a conditional conflict is determined as a move-out state when evaluated values of the at least one predicate on a data cell set immediately before committing the transaction is a Boolean value true, and the evaluated value of the predicate immediately after committing the transaction is a Boolean value false, the move-out state does not allow the transaction to commit before the corresponding conflicting transaction.

### Claim 38 (depends on 21)

The system of claim 21, wherein tasks in the transaction are executed in an optimistic manner, and wherein the transaction is validated in a pessimistic manner.

### Claim 39 (depends on 21)

The system of claim 21, wherein the one or more processors are further configured to:
resolve pseudo-deadlocks by applying a forced challenging procedure.
