US 11,921,725 B2
Processing queries based on rebuilding portions of virtual segments
George Kondiles, Chicago, IL (US); and Daniel Coombs, Chicago, IL (US)
Assigned to Ocient Holdings LLC, Chicago, IL (US)
Filed by Ocient Holdings LLC, Chicago, IL (US)
Filed on Jul. 29, 2022, as Appl. No. 17/816,070.
Application 17/816,070 is a continuation of application No. 17/155,616, filed on Jan. 22, 2021, granted, now 11,436,232.
Application 17/155,616 is a continuation of application No. 16/778,194, filed on Jan. 31, 2020, granted, now 11,061,910, issued on Jul. 13, 2021.
Prior Publication US 2022/0365935 A1, Nov. 17, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/2455 (2019.01); G06Q 50/04 (2012.01)
CPC G06F 16/24568 (2019.01) [G06F 16/2456 (2019.01); G06Q 50/04 (2013.01)] 16 Claims
OG exemplary drawing
 
1. A method for execution by a processing system of a node, comprising:
determining, by at least one processor of the processing system, at least one query for execution;
in response to the determining the at least one query:
determining, by the at least one processor of the processing system, a set of segments that include a set of rows required to execute the at least one query;
determining, by the at least one processor of the processing system, at least one virtual segment in the set of segments, wherein a first segment of the at least one virtual segment includes a plurality of sequential data portions, and wherein the first segment is included in a segment group generated by utilizing a redundancy coding scheme;
identifying, by the at least one processor of the processing system, at least two data portions in the at least one virtual segment, wherein the at least two data portions are a proper subset of the plurality of sequential data portions;
generating, by the at least one processor of the processing system, a locally rebuilt set of rows for the at least two data portions by utilizing a recovery scheme, wherein each sequential data portion of the plurality of sequential data portions is independently recoverable via the recovery scheme, and wherein the generating the locally rebuilt set of rows includes:
determining a plurality of segments in the segment group required to rebuild the first segment, wherein each segment of the plurality of segments includes a plurality of corresponding data portions;
identifying, for each segment of the plurality of segments, the at least two data portions of the corresponding data portions of the each segment of the plurality of segments required to rebuild the at least two data portions of the first segment;
retrieving the at least two data portions of the corresponding data portions of the each segment of the plurality of segments from a corresponding one of a set of memory drives, wherein the retrieving the at least two data portions of the corresponding data portions of the each segment of the plurality of segments includes generating a set of read requests to each corresponding one of the set of memory drives by batching a plurality of read requests to the each corresponding one of the set of memory drives, and wherein each read request of the plurality of read requests corresponds to one data portion of the at least two data portions of the corresponding each segment of the plurality of segments; and
utilizing the retrieved at least two data portions of the corresponding data portions of the each segment of the plurality of segments to rebuild the at least two data portions based on the redundancy coding scheme; and
generating, by the at least one processor of the processing system, query resultant data based on performing execution of the at least one query by utilizing the locally rebuilt set of rows.