“I implemented B-trees… the reason is when you insert into a B-tree node you have to shift stuff… you can pack more data in and reduce cache problems.”

Peter Mattis · The Pragmatic Engineer · Distributed databases with Peter Mattis

Play from 30:40
30:40

Audio streams from the publisher’s own feed. Verbatim does not host or copy it.

What was described

Implemented a B-tree that mimics STL map semantics to improve cache locality

Said nearby on the same subject

“He built more efficient data structures than the standard coding libraries had, ... for the C++ STL map and in Go for the Swift table implementation.”
PM
Peter Mattis
The Pragmatic Engineer ·
Why it worked Share this moment
“The B-tree actually has a lot better, it has better spatial locality and that's what made it faster. But it was actually smaller as well”
PM
Peter Mattis Speaker 2
The Pragmatic Engineer ·
Why it worked Share this moment
“If you come back after one hour and one minute, that cache is gone… cache writes are expensive… leaving sessions idle for more than an hour is expensive.”
DS
Dave Slutzkin
The Startup Podcast ·
Automation 5 minutes; 1 hour Share this moment
“I report into the chief operating officer... and also into the head of cyber underwriting... I use my cybersecurity knowledge to help them improve how we assess individual risks and map threat intelligence to portfolio scenarios.”
♫
Said on InsurTech Geek Podcast
How they work Share this moment

Moments like this, every Monday

The strongest new moments on your topics, in the speakers' own words. Free for three topics.

No card. No password. One-click unsubscribe.

Track a competitor?

Pro watches up to 25 names or phrases and emails you the morning after they are said.

See Pro, $29 a month

Verbatim quotes a short extract and links to the episode; the episode belongs to its publisher. Remove a show.