Please log in to watch this conference skillscast.
Queries such as whether a user has seen a tweet, the number of unique users who have favourited a tweet, or the number of times a tweet was seen over a period of time, are all hard to answer exactly due to having huge datasets and tight time constraints. However, the exact number is often not necessary as long as the errors are bounded. Certain algebraic data structures enable approximate answers to the queries mentioned, owing to distributed computations performed over them that are guaranteed to be correct because of their algebraic properties.
YOU MAY ALSO LIKE:
- Akka Streams for Scala | ScalaCon Workshop (Online Course on 25th - 27th October 2021)
- Essential Effects | ScalaCon Workshop (Online Course on 25th - 28th October 2021)
- ScalaCon 2021: November Edition (Online Conference on 2nd - 5th November 2021)
- Journey to the Centre of the JVM (SkillsCast recorded in May 2021)
- Connecting the dots - building and structuring a functional application in Scala (SkillsCast recorded in May 2021)
Count-Min Sketch in Real Data Applications
Laura is a data scientist at Twitter with a taste for functional programming. She mostly writes Scala, though she really admires O'Caml as well. Laura knows a bit about recommender systems, statistics and math. She did her BSc in Financial and Actuarial Mathematics in Vilnius University, where with several friends she wrote a thesis about The Role of Tail Index in Analysis of Currency Returns.