Skip to content

Henry Robinson personal blog

Beating hash tables with trees? The ART-ful radix trie

the-paper-trail.org

Read on the-paper-trail.org → Discuss on HN (40) Archived copy

Points: 152
HN comments: 40
Submissions: 1
Cited by: 0 commenters

Systems & Performance Databases & Data 2018

On Hacker News

Submitted	Title on HN	Points	Comments
Nov 9, 2018	Beating hash tables with trees? The ART-ful radix trie by HenryR	152	40

More from Henry Robinson

All 5 posts →

Distributed systems theory for the distributed systems engineer

2016265 points41 comments Systems & Performance details

The Elephant was a Trojan Horse: On the Death of Map-Reduce at Google

2014173 points119 comments Systems & Performance details

Masstree: A cache-friendly mashup of tries and B-trees

2018165 points21 comments Systems & Performance details

Making algorithms lock-free with Read-Copy Update (RCU)

2016121 points57 comments Systems & Performance details

Related posts from the same era

Reading privileged memory with a side-channel

Google Project Zero20182,334 points594 commentscited by 26 details

How Firefox Got Fast Again

Mozilla Hacks20172,180 points687 commentscited by 8 details

You Are Not Google (2017)

Bradfield School of Computer Science Blog20191,623 points730 commentscited by 14 details

The web sucks if you have a slow connection

Dan Luu20171,269 points771 commentscited by 20 details

Summary of the Amazon S3 Service Disruption

AWS Blog20171,246 points515 commentscited by 31 details

Completely Silent Computer

tp6920181,087 points489 comments details