Recursive CTEs, Trampolines, and Teaching Databases with DuckDB - with Prof. Torsten Grust
Failed to add items
Sorry, we are unable to add the item because your shopping cart is already at capacity.
Add to basket failed.
Please try again later
Add to wishlist failed.
Please try again later
Remove from wishlist failed.
Please try again later
Adding to library failed
Please try again
Follow podcast failed
Unfollow podcast failed
-
Narrated by:
-
By:
About this listen
In this episode of the DuckDB in Research series, host Dr Jack Waudby talks with Professor Torsten Grust from the University of Tübingen. Torsten is one of the pioneers behind DuckDB’s implementation of recursive CTEs.
In the episode they unpack:
- The power of recursive CTEs and how they turn SQL into a full-fledged programming language.
- The story behind adding recursion to DuckDB, including the using key feature and the trampoline and TTL extensions emerging from Torsten’s lab.
- How these ideas are transforming research, teaching, and even DuckDB’s internal architecture.
- Why DuckDB makes databases exciting again — from classroom to cutting-edge systems research.
If you’re into data systems, query processing, or bridging research and practice, this episode is for you.
Links:
- USING KEY in Recursive CTEs
- How DuckDB is USING KEY to Unlock Recursive Query Performance
- Trampoline-Style Queries for SQL
- U Tübingen Advent of code
- A Fix for the Fixation on Fixpoints
- One WITH RECURSIVE is Worth Many GOTOs
- Torsten's homepage
- Torsten's X
Hosted on Acast. See acast.com/privacy for more information.
No reviews yet