Performance Considerations for Hash Partitioning
------------------------------------------------
Hash partitions are mostly used when we do not know beforehand how much data
will map into a given range and sizes of range partitions would differ quite substantially.
Hash partitioning is an effective means of distributing data, because Oracle hashes
the data into a number of partitions, each of which can reside on a separate device.
Thus, data is evenly spread over as many devices as required to maximize I/O throughput.
The number of partitions should be a power of two (2, 4, 8, and so on) to obtain the most
even data distribution. Local indexes on hash partitions are equipartitioned with the
table data, enabling hash partitioning to be more effective in parallel index access
and PDML. Additionally,
Oracle recommends hash partitioning on high cardinality key
columns, preferably unique keys.
Partager