Currently, the algorithmic complexity of future as-of-join is super-linear in the input size because the MemoStore is scanning all keys when cleaning up entries by-time.; this is due to the current entry data structures used in MemoStore. The algorithmic complexity should be improved to be linear.
Describe the enhancement requested
Currently, the algorithmic complexity of future as-of-join is super-linear in the input size because the
MemoStore
is scanning all keys when cleaning up entries by-time.; this is due to the current entry data structures used inMemoStore
. The algorithmic complexity should be improved to be linear.Component(s)
C++