Disseminate: The Computer Science Research Podcast - DuckDB in Research S2 Coming Soon!

Episode Date: October 16, 2025

Hey folks! The DuckDB in Research series is back for S2!In this season we chat with:Torsten Grust: Recursive CTEsAbigale Kim: Anarchy in the DatabaseMihail Stoian: Parachute: Single-Pass Bi-Directiona...l Information PassingPaul Gross: Adaptive Factorization Using Linear-Chained Hash TablesWhether you're a researcher, engineer, or just curious about the intersection of databases and innovation we are sure you will love this series. Hosted on Acast. See acast.com/privacy for more information.

Transcript
Discussion (0)
Starting point is 00:00:00 Disseminate the computer science research podcast, the DuckDB in Research series. Hey folks, Jack here with a quick update. I'm pleased to announce the Disseminate and DuckDB collaboration continues and we are back with a season two of the DuckDB in Research series. A reminder for those who are maybe new to the show or miss the first season, this podcast looks at all the various ways DuckDB has been used in the world of research and academia. this might be as a vehicle to teach databases or maybe as a platform to experiment and develop a new cool wonderful things. So yeah, if you're a researcher, an engineer or just a
Starting point is 00:00:39 general database enthusiast and this is the show for you, we've got four episodes for you in season two and we're going to be kicking things off with Torsten Grust from the University of Tubingham. Torsten really is the expert on recursive common table expressions. I have recursive CT. So if you've ever seen those anywhere, and never wonder what they are, please tune into this episode and by the end of it, you'll know everything you need to know about them. We then have Abigail Kim, who is a PhD student at Carnegie Gemmellon University, who is going to come on and call some chaos and going to tell us all about anarchy in the database,
Starting point is 00:01:12 and that episode is going to be exploring database extensibility. We then got Mihail Stoyan, another PhD student from the technical university of Munich, and he is going to tell us how we can speed up our queries with parachutes. And by this, I mean, this is a technique called single pass, bi-directional information passing. So if you don't know what that is now, tune into Mihail's episode, and by the end of that, I'm sure you will. And we're going to finish the season with Paul Gross, who is going to be talking to us about how he's implemented factorize aggregations and worst-case optimal joins in DuckDB as part of his paper that was published, research paper that was published at the cider conference this year. so yeah if any of those episodes do appeal to you then please tune in we're going to be releasing the episodes every thursday for the next month so yeah please tune in and hope you enjoy the show

There aren't comments yet for this episode. Click on any sentence in the transcript to leave a comment.