reftable: comparison of record keys is inefficient
The merged iterator needs to compare record keys quite a lot so that it can return the records in the expected order. The comparisons are quite inefficient though as they require a lot of allocations and copying of bytes. This should be improved.