US 12,455,882 B2
Generating addendum parts for subsequent processing via a database system
Greg R. Dhuse, Chicago, IL (US); Anna Veselova, Chicago, IL (US); Benjamin Daniel Rabe, Sandy, UT (US); Matthew Ashbeck, Chicago, IL (US); Pieter Charles Jas Svenson, Seattle, WA (US); and Richard Wang, Ellicott City, MD (US)
Assigned to Ocient Holdings LLC, Chicago, IL (US)
Filed by Ocient Holdings LLC, Chicago, IL (US)
Filed on Aug. 3, 2023, as Appl. No. 18/364,761.
Claims priority of provisional application 63/516,219, filed on Jul. 28, 2023.
Prior Publication US 2025/0036622 A1, Jan. 30, 2025
Int. Cl. G06F 16/2453 (2019.01); G06F 16/22 (2019.01); G06F 16/2455 (2019.01)
CPC G06F 16/24542 (2019.01) [G06F 16/2272 (2019.01); G06F 16/24532 (2019.01); G06F 16/2456 (2019.01); G06F 16/24568 (2019.01)] 13 Claims
OG exemplary drawing
 
1. A method comprising:
obtaining, by a computing node of a plurality of computing nodes of pluralities of computing nodes of a parallelized database system, a request to delete a set of rows of a plurality of rows of pluralities of rows of a dataset, wherein the dataset is dispersedly stored across the plurality of computing nodes;
generating, by an update module of at least one computing node of the pluralities of computing nodes, a row list identifying the set of rows for deletion from the plurality of rows;
compressing, by the update module, the row list to produce a compressed row list;
dividing, by the update module, the compressed row list into a set of compressed row list blocks to produce an addendum part; and
updating, by the update module, shared state data to include the addendum part, wherein the shared state data is shared by the update module with the plurality of computing nodes and mediated by the plurality of computing nodes in accordance with a consensus protocol.