+1 This is a good proposal. However, I wonder how likely it is to hit correctly ordered record keys with shuffling. Anyway, red-black tree would be useful in the worst case and I encourage you to create a patch for review.
Regards, Sagar On Fri, Jun 10, 2022 at 9:20 PM 陆游 <marssss2...@gmail.com> wrote: > Hi Community， > I found that the existing KeyRangeLookupTree implementation is Binary > Sorting Tree. > Although it is shuffled before insertion, it may still cause uneven > distribution. I want to implement it as a Red Black Tree. What do you > think? > Thanks! >
