Thanks so much for looking into this!
Last weekend I started playing with the code, but it looks like I may need
to upgrade to an SSD to get a reasonable build time.
For Zone B I was imagining there would be a way to try increasingly large
jumps, perhaps aided by an index cursor that remembered
Hi Sergey!
Actually fetching min & max value for each keys (key1=1 and key2=2 in your
case) should not cost much?
Then you can compute the overlap zone (Zone B in your graph) and directly
perform a jump on the beginning of Zone B and stop at the end of Zone B instead
of EOF, using the index
Hi, Alexey!
Am 01.10.19 um 14:29 schrieb Alexey Mogilyovkin:
Hello, I would like to finish the task I was working on during GSoC.
Nikita told me that there are some architectural questions to my code.
Can you tell about them in more detail?
Here you can find list of related MDEVs (as well as
3 matches
Mail list logo
