Round-robin partitioning distributes rows evenly across all partitions by cycling through them sequentially. Unlike hash or range partitioning, round-robin doesn't consider data values: it simply ensures equal distribution regardless of the data content.