Question: How do you implement table partitioning by hash in PostgreSQL?


Partitioning is a technique in PostgreSQL that allows tables to be divided into smaller, more manageable pieces, called partitions. It can significantly improve performance for large tables on queries that filter rows based on the partition key. One of the partitioning strategies available in PostgreSQL is hash partitioning. This method distributes rows across partitions based on the hash value of a partition key.

Steps to Implement Hash Partitioning

1. Create a Partitioned Table

To set up a table for hash partitioning, you must first create the parent table and define it as partitioned by hash. Here's how:

CREATE TABLE orders ( order_id BIGINT NOT NULL, order_date DATE NOT NULL, customer_id BIGINT NOT NULL, amount NUMERIC NOT NULL ) PARTITION BY HASH (order_id);

In this example, orders is partitioned based on the hash value of order_id.

2. Create Partitions

After creating the partitioned table, you need to manually create each partition. You must specify the modulus and remainder for each partition, which determines how rows are distributed. For instance, to create four partitions, you would use:

CREATE TABLE orders_1 PARTITION OF orders FOR VALUES WITH (modulus 4, remainder 0); CREATE TABLE orders_2 PARTITION OF orders FOR VALUES WITH (modulus 4, remainder 1); CREATE TABLE orders_3 PARTITION OF orders FOR VALUES WITH (modulus 4, remainder 2); CREATE TABLE orders_4 PARTITION OF orders FOR VALUES WITH (modulus 4, remainder 3);

This divides the space of possible hash values into four parts, with each partition handling a quarter of the data.

Benefits of Hash Partitioning

  • Improved Query Performance: Queries that filter on the partition key can be limited to only a subset of partitions, potentially reducing scan times.
  • Parallel Processing: Operations such as backups and maintenance can be performed on individual partitions in parallel, improving overall efficiency.
  • Data Distribution: Hash partitioning is particularly useful when you want an even distribution of data across partitions without any natural range or list-based separation criteria.


  • Choosing a Partition Key: The choice of partition key is crucial. It should be a column commonly used in filters and evenly distribute the data.
  • Number of Partitions: More partitions mean more overhead in terms of planning and managing these partitions. It's essential to balance the number of partitions based on your hardware and query patterns.
  • Maintenance: While partitioning can simplify maintenance tasks by allowing you to work on subsets of data, it also requires careful management of these partitions over time, including potential rebalancing if data distribution changes.

Hash partitioning in PostgreSQL provides a powerful way to manage large datasets, but like any other database design decision, it requires careful planning and consideration of your specific use case.

Was this content helpful?

White Paper

Free System Design on AWS E-Book

Download this early release of O'Reilly's latest cloud infrastructure e-book: System Design on AWS.

Free System Design on AWS E-Book
Start building today

Dragonfly is fully compatible with the Redis ecosystem and requires no code changes to implement.