Reading the description of round-robin partitioning leaves me unclear. The description is:
c. Round-robin partitioning: This is a very simple strategy that ensures uniform data distribution. With ‘n’ partitions, the ‘i’ tuple is assigned to partition (i mod n).
When I read this, it implies that round-robin partitioning actually relies on a hash function (i mod n). But does the partitioning actually rely on that “function” explicitly being executed, or would it be more appropriate to think of the partition being assigned from a sequential read of a list of possible partitions, always assigning to the next partition in the list, with no real way to reverse engineer where any particular record exists without having to search every partition?