Systems and methods for scalable database technology

A computer-implemented method of committing proposed changes to a relational database as branches to the relational database, the method comprising:

• accessing, by control circuitry, a state table stored in non-transitory memory;
• determining a first self-validating delta table based on a first proposed change to the state table at a first timestamp, wherein the first self-validating delta table comprises a first delta value and a first revert value;
• generating a first pointer to a first branch comprising the first self-validating delta table for the first proposed change to the state table;
• determining a second self-validating delta table based on a second proposed change to the state table at a second timestamp, wherein the second self-validating delta table comprises a second delta value and a second revert value;
• generating a second pointer to a second branch comprising the second self-validating delta table for the second proposed change to the state table;
• determining whether the first timestamp is before the second timestamp;
• and
• based on determining the first timestamp is before the second timestamp, placing on the state table, without locking the state table, the first pointer to the first branch indicating the first proposed change is committed to the state table.

A computer-implemented method of committing proposed changes to a relational database as branches to the relational database, the method comprising:

• accessing, by control circuitry, a state table stored in non-transitory memory;
• determining a first self-validating delta table based on a first proposed change to the state table at a first timestamp, wherein the first self-validating delta table comprises a first delta value and a first revert value;
• generating a first pointer to a first branch comprising the first self-validating delta table for the first proposed change to the state table;
• determining a second self-validating delta table based on a second proposed change to the state table at a second timestamp after the first timestamp, wherein the second self-validating delta table comprises a second delta value and a second revert value;
• generating a second pointer to a second branch comprising the second self-validating delta table for the second proposed change to the state table;
• determining whether there is a conflict with the first self-validating delta table and the second self-validating delta table without locking the state table;
• and
• after determining there is no conflict with the first self-validating delta table and the second self-validating delta table:
• placing on the state table, without locking the state table, the first pointer to the first branch indicating the first proposed change is committed to the state table;
• and
• placing on the state table, without locking the state table, the second pointer to the second branch indicating the second proposed change is committed to the state table.

A computer-implemented method of committing proposed changes to a relational database as branches to the relational database, the method comprising:

• accessing, by control circuitry, a state table stored in non-transitory memory;
• determining a first self-validating delta table based on a first proposed change to the state table at a first timestamp, wherein the first self-validating delta table comprises a first delta value and a first revert value;
• generating a first pointer to a first branch comprising the first self-validating delta table for the first proposed change to the state table;
• determining, without locking the state table, there is no conflict with the first self-validating delta table and the state table;
• and
• placing on the state table, without locking the state table, the first pointer to the first branch indicating the first proposed change is committed to the state table.