Probing operations of KeyProber, as a trait so tests can substitute
an in-memory implementation. See KeyProberโs methods for each
operationโs contract.
Splits parent into prefixes one character longer. i.e. prefix โaโ, upper bound โbโ in table
with pks: [โaโ, โabโ, โabcโ, โabdโ, โafโ, โbbโ] will return: [โabโ, โafโ].
Computes up to num_workers - 1 partition boundaries that divide the primary key space
into num_workers roughly even partitions. At most max_probed_prefixes prefixes are
probed in MySQL to bound the time spent. Each prefix probe costs a few queries that
should each be quick (index dives, instead of table scans).