feat: smart binary search by indexing the lookup results of the previous search

currently in `QueryProcessor::getTimeWeightedAverage`, the function has to perform 2 binary searches in order to find the two accumulators. The second search can be "warm" by using an in-memory or transient lookup table to tell the algo where to look. 