Single level, multi-dimension, hash-based table partitioning

A computer-implemented method comprising:

• receiving a request to insert a record in a fact table included in a database, the fact table having multiple partitions, each of the multiple partitions being included in a respective host;
• determining a first hash value from a first value included in the record, the first value corresponding with a first dimension table corresponding with the fact table;
• determining, based on the first hash value, a first set of candidate partitions of the multiple partitions;
• determining a second hash value from a second value included in the record, the second value corresponding with a second dimension table corresponding with the fact table;
• determining, based on the second hash value, a second set of candidate partitions of the multiple partitions;
• comparing the first set of candidate partitions with the second set of candidate partitions to determine a common partition between the first set of candidate partitions and the second set of candidate partitions;
• inserting the record into the common partition;
• receiving a request to join the first dimension table and the second dimension table with the fact table;
• determining a third hash value from a dimension value included in a row of the first dimension table;
• determining, based on the third hash value, a third set of candidate partitions of the plurality of partitions the third set of candidate partitions being a first subset of the plurality of partitions;
• sending the row of the first dimension table to each of the respective hosts of the third set of candidate partitions;
• determining a fourth hash value from a dimension value included in a row of the second dimension table;
• determining, based on the fourth hash value, a fourth set of candidate partitions of the plurality of partitions, the fourth set of candidate partitions being a second subset of the plurality of partitions, the third set of candidate partitions and the fourth set of candidate partitions having at least one common partition;
• and
• sending the row of the second dimension table to each of the respective hosts of the fourth set of candidate partitions;
• and
• performing intermediate join operations including:
• joining the row of the first dimension table with each partition of the third set of candidate partitions;
• and
• joining the row of the second dimension table with each partition of the fourth set of candidate partitions.