Patent ID: 11868331
Assignee: nan
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 15:
16. The system of claim 10, wherein:
the secondary storage additionally stores a third data table comprising a third array, the third array comprising a plurality of third-table rows, each third-table row of the plurality of third-table rows (i) storing a third-table key, of a plurality of third-table keys, that uniquely identifies said each third-table row in the third array and (ii) having a third-table row position that uniquely locates said each third-table row in the third array;
the third array has a fifth subset of matched third-table rows, the compacted first data table has a sixth subset of twice-matched first-table rows, the reordered second data table has a seventh subset of twice-matched second-table rows, the third-table key of each matched third-table row of the fifth subset equaling both (i) the first-table key of a corresponding twice-matched first-table row of the sixth subset and (ii) the second-table key of a corresponding twice-matched second-table row of the seventh subset;
the compacted first data table has an eighth subset of unmatched-matched first-table rows, the first-table key of each unmatched-matched first-table row of the eighth subset not equaling any of the plurality of third-table keys;
the reordered second data table has a ninth subset of unmatched-matched second-table rows, the second-table key of each unmatched-matched second-table row of the ninth subset not equaling any of the plurality of third-table keys;
the third data table has a tenth subset of unmatched third-table rows, the third-table key of each unmatched third-table row of the tenth subset not equaling any of the first-table keys of the compacted first data table; and
the table-aligning engine includes additional machine-readable instructions that, when executed by the processor, control the system to:
generate a second key search tree for the plurality of third-table keys,
construct, using the second key search tree, a second row-index array,
compact, using the second row-index array, the compacted first data table into a twice-compacted first data table by discarding the unmatched-matched first-table rows of the compacted first data table,
compact, using the second row-index array, the reordered second data table into a compacted-reordered second data table by discarding the unmatched-matched second-table rows of the reordered second data table,
reorder, using the second row-index array, the third data table into a reordered third data table by (i) discarding the unmatched third-table rows from the third data table and (ii) rearranging the matched third-table rows such that an order of the third-table keys of the matched third-table rows equals both an order of the first-table keys of the twice-matched first-table rows and an order of the second-table keys of the twice-matched second-table rows, and
join the twice-compacted first data table, the compacted-reordered second data table, and the reordered third data table.