1 HN user recommended this talk1 month2017–2025score 1.5
Years with an HN recommendation, 2007–2026
Commenters credit it as the place they first learned about succinct data structures, and found it left a lasting impression.
Edward Kmett's 2013 talk at Prezi in Budapest on succinct data structures, which store data in close to the information-theoretic minimum space while supporting fast queries. It ties together the research and walks through his Haskell succinct library.
“one of his many talks that left me with an incredibly lasting impression” (HN, 2018)
I don't feel like it tonight. Drinking whiskey and trying not to think about how effed up the Israel footage and the North Korea situation are. Maybe that's why it's not the best post. I don't mean to crap on the work presented. Great article, good summary, and the tech is solid. It's just older than what excites me; a lot of progress has been made in 20 years and the majority of it hasn't found commercial applications. But here is a citation root for a lot of amazing work in this space: [link] My absolute hero Edward Kmett gave a talk stitching a lot of this work together a long time ago: [this video] . I have no idea if he's pursued it, it's just one of his many talks that left me with an incredibly lasting impression. Variants of this technique work for arbitrary documents and structures, work better at very high volume, have cache oblivious properties, and support transactions. Universal indexes that are reasonably good for all queries (as opposed to specfiic queries) are also possible. Coupled with discrimination-based techniques for O(n) table joins, there's probably a whole startup around there. Sorry I can't do better right now.
Kmett's talk stitching together succinct structures research left a lasting impression.
I find it mildly amusing that people are competing on the fastest decoder of horribly inefficient format. Don't get me wrong, I like e.g. ZX Spectrum demos, but the practical utility of such endeavor is questionable. But that aside, I wonder how this compares to the compressed indexes approaches (see [this video] and [link] ), obviously, once the index is built.
I first heard of the concept of succinct data structures from Edward Kmett, a famous Haskeller behind many popular Haskell libraries. He gave a talk on succinct data structures a long time ago: [this video]
Where the commenter first learned of succinct data structures.
Video list and Hacker News comment labels from HackerTube (prompted by @karpathy), released under ODC-By 1.0, built on the open-index/hacker-news archive. Hacker News data is provided by Y Combinator; comments remain the work of their authors. Video titles, channel names and thumbnails belong to their creators and are shown via YouTube. HackerTube Watch is an unofficial edition. Data export of 2026-10-31.
3 Hacker News comments
From the HN archive; up to 20 kept per video, favoring different commenters. Recommendations first.
Read more
Citations, criticism and jokes