Multiple choice technology databases

An application architect is considering to redesign ORDERS table of an ORDER ENTRY application using partitioning. He's NOT very sure about the usage of ORDERS table from end user perspective. However, he wants to distribute the data equally across all table partitions. Which partitioning scheme is his obvious choice?

  1. RANGE

  2. HASH

  3. LIST

  4. INTERVAL
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

HASH partitioning distributes rows uniformly across partitions using a hash algorithm on the partitioning key. It's ideal when access patterns are unknown or when even data distribution is desired. RANGE requires logical ranges and LIST requires known discrete values.

Keep practicing — related questions