Hash Partitioning
Hash partitioning maps data to partitions based on a hashing algorithm that
Oracle applies to a partitioning key identified by the user. The hashing
algorithm evenly distributes rows among partitions. Therefore, the resulting
set of partitions should be approximately of the same size. This also makes
hash partitioning ideal for distributing data evenly across devices. Hash
partitioning is also a good and easy-to-use alternative to range partitioning
when data is not historical in content.
Note:
You cannot create alternate hashing algorithms.
Which is another way of saying it is a proprietary algorithm :-)
Paul in VT
Received on Fri Mar 31 2000 - 08:13:35 CST
