Sergi Vladykin, do you think getAll() operation on B-Tree will help here? Now getAll() is a sequence of constant-time lookups. Situation is different for tree structures. So, we can traverse the tree only once given we have keys belonging to a single partition?
--Yakov 2017-05-12 0:48 GMT+03:00 Yakov Zhdanov <[email protected]>: > How many values are in your cache? > > SLB? What is it? > > >Will there be any difference between 1.9 and 2.0 if you send the same > >number of empty jobs? > >None. Exact same code > . > I want you to check if compute engine became slower in your deployment. If > you comment out all lookups inside the job and run the code against 1.9 and > 2.0 clusters would they show the same results? > > >It all local processing. And a lot of it. CPU sits around 80-90%. > >The compute data is not small, so we colocate the compute w/ the data. > >NOTE: the Results of the compute is small. a few 100 bytes. > > Agree, colocated jobs are the only choice here. > > Btw, what instance types do you use? > > --Yakov > >
