Question related to performance with Hash Partitioning
I have a question related to performance with Hash Partitioning. We are planning on implementing Hash Partitioning for some of the EBS database tables. What is the typical number of partitions implemented for large tables? I was thinking 4 hash partitions should be good enough for tables with less than 25GB in size. Are there any general rules/formulas we can follow?