From what I'm understanding, DynamoDB tries to put items with the same partition key into the same partition. My question is how does the hashing work when the partition is full and gets split into 2 different partitions?
For example, a table has a partition key A, and DynamoDB put all items with partition key A into the same partition P, then P is full, dynamo will split P into P1 and P2, now a new item I with a partition key A is inserted by the client, How does dynamo decide which partition (i.e. P1 and P2) to insert I?