Skip to content
0:00 / 0:00

#hyperloglog#cpp#heavyhitters

CppCon 2017: Nicholas Ormrod “Fantastic Algorithms and Where To Find Them”

CppCon

189K subscribers • 123 videos on Hallway • Conference channel

YouTube
  • Recommended by 2 people: 1 in engineering communities and 1 curated list.
  • Presented by Nicholas Ormrod, Software Engineer at Facebook
  • Linked in the descriptionCppCon/CppCon2017

Advanced. Deep dive for people who know the field.

66K views9 years ago2 recommendations

Computer scienceSystems programmingAlgorithmsData structuresPerformance and optimization

Nicholas Ormrod presents rare but highly practical algorithms used at Facebook, including cardinality estimators and stack-safe tree destruction.

Presentation Slides, PDFs, Source Code and other presenter materials are available at: github.com/CppCon/CppCon2017 — Come dive into some exciting algorithms — tools rare enough to be novel, but useful enough to be found in practice. Want to learn about "heavy hitters" to prevent DOS attacks? Come to this talk. Want to avoid smashing your stack during tree destruction? Come to this talk. Want to hear war stories about how a new algorithm saved the day? Come to this talk! We'll dive into the finest of algorithms and see them in use — Fantastic Algorithms, and Where To Find Them. — Nicholas Ormrod: Facebook, Software Engineer Nicholas is a infrastructure engineer at Facebook. If he talks too much, disable him with a well-placed nerd snipe. — Videos Filmed & Edited by Bash Films: BashFilms.com Work at Hudson River Trading (HRT): tinyurl.com/safxfctf --- Videos Filmed & Edited by Bash Films: BashFilms.com

Why it's here

2 people recommend this

What people say. Recommended as an excellent talk on approximation algorithms like HyperLogLog and their real-world production use cases.

Moments people linked to

programming-talkscurated list on GitHubRecommends

Under “C++”

Fantastic Algorithms and Where To Find Them 00:46:57 by **Nicholas Ormrod** (2017)

u/dbramucciin r/programming • Recommends

On “Portal Abstractions - Solving problems with Abstract Algebra and Probabilistic data structures”

It is cool. If falls into a class of algorithms known as "Approximation Algorithms", where there is a proof about how close the answer given will be to the correct answer and as long as you are ok with that much error you can get massive speedups. [It's a useful tradeoff if you are at Facebook and want to count the distinct number of compiled files in the past 24, actually being able to run it in exchange for a slight loss of precision]
4View on Reddit

u/bmb0610in r/programming • Mentions

On “Papers we love: HyperLogLog - the analysis of a near-optimal cardinality estimation algorithm [video]”

Facebook has this in production.
1View on Reddit