[C++] Improve future as-of-join algorithmic complexity
Open
Component: C++
Type: enhancement
- Dominant language
- C++
- Stars
- 17.1k
- Forks
- 4.3k
- Avg merge
- 3d 13h
- Merged PRs (30d)
- 88
Description
### 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 in `MemoStore`. The algorithmic complexity should be improved to be linear.
### Component(s)
C++
Contributor guide
Assessment
This issue has not been assessed yet.