US 11,675,767 B1
Hash based rollup with passthrough
Alexander Behm, Lafayette, CA (US); and Ankur Dave, Berkeley, CA (US)
Assigned to Databricks, Inc., San Francisco, CA (US)
Filed by Databricks, Inc., San Francisco, CA (US)
Filed on Nov. 16, 2020, as Appl. No. 17/99,467.
Int. Cl. G06F 16/00 (2019.01); G06F 16/22 (2019.01); G06F 16/28 (2019.01); G06F 16/242 (2019.01); G06F 16/2455 (2019.01); G06F 16/13 (2019.01)
CPC G06F 16/2255 (2019.01) [G06F 16/134 (2019.01); G06F 16/2272 (2019.01); G06F 16/244 (2019.01); G06F 16/24556 (2019.01); G06F 16/285 (2019.01)] 32 Claims
OG exemplary drawing
 
1. A system, comprising:
a plurality of computing units, wherein a first computing node of the plurality of computing units comprises:
a communication interface configured to:
receive an indication to roll up data in a data table; and
a processor coupled to the communication interface and configured to:
build a preaggregation hash table based at least in part on a set of columns of the data table by aggregating input rows of the data table;
for each preaggregation hash table entry of the preaggregation hash table: provide the preaggregation hash table entry to one or more other computing units of the plurality of computing units based at least in part on a distribution hash value;
receive a set of entries from computing units of the plurality of computing units; and
build an aggregation hash table based at least in part on the set of entries by aggregating the set of entries.