Succinct Data Structures

Channel:Edward Kmett · Length:1:26:10 · Published:2013-11-12 · Views:9154

Watch on YouTube

Summary

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.

Why HN recommends it

Commenters credit it as the place they first learned about succinct data structures, and found it left a lasting impression.

one of his many talks that left me with an incredibly lasting impression — HN, 2018

Functional programming · Algorithms & data structures · Information theory & signal processing

Subtitles (excerpt)

[Music] Hi, there is not much pizza left. Feel free to take some more. So, thank you all for coming. Uh, as you may have seen, we have Edward Met here all the way from far away United States. And he brought some stickers. I believe there is now more Heskell stickers in Hungary than there are people who know what Heskell is. Feel free to grab some. Take as many as you want. There's like a roll of a thousand there. Um if you guys run out, I will bring another one next time. Thank you. So, you might want to come a bit closer because will be using a whiteboard. That's right. Hiding all the way over there. You're not going to be able to see it. That's right. So, I guess that's all for introductions. Go ahead. Oh dear. Let's see how I can maybe throw that around there. I'm going to try and actually hold a microphone and a uh dry erase marker at the same time. We'll see if I can actually manage this act. All right. Um, so I love Haskell. It's it's my favorite language to think in. Um, there's a lot of things that Haskell is really good at. Um, and there's just a few places where I want to think some thoughts that Haskell really like as an ecosystem hasn't um, devoted any of its attention. Um I'm I'm a big fan of like um how to put it not writing

On Hacker News

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 … — KirinDave, 2018-05
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: [VIDEO] — kccqzy, 2025-03
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 [VIDEO] and [LINK] ), obviously, once the index is built. — js8, 2017-05

Related videos