GitHub user PsiACE added a comment to the discussion: What large-scale data or ML challenges are you facing?
A common requirement in cache replacement algorithms is tracking element frequency and recency. Frequency can be directly computed using countmin, which has been proven effective in LFU-based algorithms, including variants with windows and decay. However, I'm uncertain about how to properly design and utilize a sketch to track recency. Previously, I calculated it by combining a countmin sketch with the length of a virtual queue. GitHub link: https://github.com/apache/datasketches-rust/discussions/64#discussioncomment-15506285 ---- This is an automatically sent email for [email protected]. To unsubscribe, please send an email to: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
