xed number of parts (called partitions) using a hashing algorithm to determine in which partition and entry should be located.</p><p>By partitioning an index into multiple physical parts, you are accessing much smaller objects which makes it faster and more reliable.</p><p>With hash partitioning, an index entry is placed into a partition based on the result of passing the partitioning key into a hashing algorithm.</p><p>This object is immutable.</p><p>Properties:</p><ul><li>case_sensitive - controls wether 