[GitHub] [arrow] rtpsw opened a new issue, #36144: [C++] Improve future as-of-join algorithmic complexity

["rtpsw (via GitHub)" <gi...@apache.org>]

rtpsw opened a new issue, #36144:
URL: https://github.com/apache/arrow/issues/36144

   ### 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++


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: issues-unsubscribe@arrow.apache.org.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org

[GitHub] [arrow] rtpsw commented on issue #36144: [C++] Improve future as-of-join algorithmic complexity

["rtpsw (via GitHub)" <gi...@apache.org>]

rtpsw commented on issue #36144:
URL: https://github.com/apache/arrow/issues/36144#issuecomment-1595710384

   take


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: github-unsubscribe@arrow.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org