Databases · Senior · Question 65 of 75

When is hash partitioning useful?

✓Correct answer: To spread a large table evenly across partitions by a key without natural ranges, e.g. to keep each partition's indexes smaller
2To drop old data cheaply
3To make range queries on dates faster

Explanation

Range partitioning by time is better for retention. Hash partitioning only prunes for equality on the key.

Further reading

PostgreSQL: Table partitioning ↗

Test yourself

Take the Databases · Senior quiz: questions and options are shuffled, and you get a review of your mistakes at the end.