Do you know the difference between hash and range partitioning?

Hash partitioning distributes rows by applying a hash function to the partition key, placing each row into one of N buckets. This yields even distribution and good load balancing, but it makes range queries inefficient because the data for a given key range is spread across many partitions. Range partitioning, on the other hand, splits data into contiguous key ranges (e.g., 1‑1000, 1001‑2000). It is ideal for queries that filter on a range of values, as all relevant rows reside in a few partitions, but it can lead to data skew if the key distribution is uneven. In practice, hash partitioning is chosen for write‑heavy workloads where balanced inserts matter, while range partitioning is used for analytical queries that scan contiguous data.