-
Type: Task
-
Resolution: Won't Fix
-
Priority: Major - P3
-
None
-
Affects Version/s: None
-
Component/s: Btree
-
Storage Engines
-
5
-
나비 (nabi) - 2024-04-16
Currently, at the end of the search near, we always first walk next then prev to find a valid key. However, if we have cursor bounds set, we should have a good indication which direction we should go first.
If the user have the lower bound set, we should go next as user has told us that they want a larger value. Otherwise, if the upper bound is set, we should go prev first.