In this episode of Disseminate: The Computer Science Research Podcast, host Jack Waudby sits down with Xiangyao Yu (UW–Madison), one of the leading voices shaping the next generation of cloud-native databases.

We dive deep into disaggregation — the architectural shift transforming how modern data systems are built. Xiangyao breaks down:

• Why traditional shared-nothing databases struggle in cloud environments
• How separating compute and storage unlocks elasticity, scalability, and cost efficiency
• The evolution of disaggregated systems, from Aurora and Snowflake through to advanced pushdown processing and new modular services
• His team's research on reinventing core protocols like 2-phase commit for cloud-native environments
• Real-time analytics, HTAP challenges, and the Hermes architecture
• Where disaggregation goes next — indexing, query optimizers, materialized views, multi-cloud architectures, and more

Whether you're a database engineer, researcher, or a practitioner building scalable cloud systems, this episode gives a clear, accessible look into the architecture that’s rapidly becoming the default for modern data platforms.

Links:

• Xiangyao Yu's Homepage
• Disaggregation: A New Architecture for Cloud Databases [VLDB'25]

Hosted on Acast. See acast.com/privacy for more information.

In this episode of Disseminate: The Computer Science Research Podcast, Jack sits down with Navid Eslami, PhD researcher at the University of Toronto, to discuss his award-winning paper “DIVA: Dynamic Range Filter for Variable Length Keys and Queries”, which earned Best Research Paper at VLDB.

Navid breaks down how range filters extend the power of traditional filters for modern databases and storage systems, enabling faster queries, better scalability, and theoretical guarantees. We dive into:

• How DIVA overcomes the limitations of existing range filters
• What makes it the “holy grail” of filtering for dynamic data
• Real-world integration in WiredTiger (the MongoDB storage engine)
• Future challenges in data distribution smoothing and hybrid filtering

Whether you're a database engineer, systems researcher, or student exploring data structures, this episode reveals how cutting-edge research can transform how we query, filter, and scale modern data systems.

Links:

• Diva: Dynamic Range Filter for Var-Length Keys and Queries [VLDB'25]
• Diva on GitHub
• Navid's LinkedIn

Hosted on Acast. See acast.com/privacy for more information.

In this episode of the DuckDB in Research series, host Jack Waudby sits down with Paul Groß, PhD student at CWI Amsterdam, to explore his work on adaptive factorization and worst-case optimal joins - techniques that push the boundaries of analytical query performance.

Paul shares insights from his CIDR'25 paper “Adaptive Factorization Using Linear Chained Hash Tables”, revealing how decades of database theory meet modern, practical system design in DuckDB. From hash table internals to adaptive query planning, this episode uncovers how research innovations are becoming part of real-world systems.

Whether you’re a database researcher, engineer, or curious student, you’ll come away with a deeper understanding of query optimization and the realities of systems engineering.

Links:

• Adaptive Factorization Using Linear-Chained Hash Tables

Hosted on Acast. See acast.com/privacy for more information.

In this episode of the DuckDB in Research series, host Jack Waudby sits down with Mihail Stoian, PhD student at the Data Systems Lab, University of Technology Nuremberg, to unpack the cutting-edge ideas behind Parachute, a new approach to robust query processing and bidirectional information passing in modern analytical databases.

We explore how Parachute bridges theory and practice, combining concepts from instance-optimal algorithms and semi-join filtering to boost performance in DuckDB, the in-process analytical SQL engine that’s reshaping how research meets real-world data systems.

Mihail discusses:

• How Parachute extends semi-join filtering for two-way information flow
• The challenges of implementing research ideas inside DuckDB
• Practical performance gains on TPC-H and CEB workloads
• The future of adaptive query processing and research-driven system design

Whether you're a database researcher, systems engineer, or curious practitioner, this deep-dive reveals how academic innovation continues to shape modern data infrastructure.

Links:

• Parachute: Single-Pass Bi-Directional Information Passing VLDB 2025 Paper
• Mihail's homepage
• Parachute's Github repo

Hosted on Acast. See acast.com/privacy for more information.

In this episode of the DuckDB in Research series, host Jack Waudby talks with Abigale Kim, PhD student at the University of Wisconsin–Madison and author of VLDB 2025 paper: “Anarchy in the Database: A Survey and Evaluation of DBMS Extensibility”. They explore how database extensibility is reshaping modern data systems — and why DuckDB is emerging as the gold standard for safe, flexible, and high-performance extensions. Abigale shares the inside story of her research, the surprises uncovered when testing Postgres and DuckDB extensions, and what’s next for extensibility and composable database design.

This episode is perfect for researchers, practitioners, and students interested in databases, systems design, and the interplay between academia and industry innovation.

Highlights:

• What “extensibility” really means in a DBMS
• How DuckDB compares to Postgres, MySQL, and Redis
• The rise of GPU-accelerated DuckDB extensions
• Why bridging research and engineering matters for the future of databases

Links:

• Anarchy in the Database: A Survey and Evaluation of Database Management System Extensibility VLDB 2025
• Rethinking Analytical Processing in the GPU Era

You can find Abigale at:

• X
• Bluesky
• Personal site

Hosted on Acast. See acast.com/privacy for more information.

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.

Hey folks! The DuckDB in Research series is back for S2!

In this season we chat with:

• Torsten Grust: Recursive CTEs
• Abigale Kim: Anarchy in the Database
• Mihail Stoian: Parachute: Single-Pass Bi-Directional Information Passing
• Paul Gross: Adaptive Factorization Using Linear-Chained Hash Tables

Whether 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.

In this episode of Disseminate: The Computer Science Research Podcast, guest host Bogdan Stoica sits down with Ao Li and Rohan Padhye (Carnegie Mellon University) to discuss their OOPSLA 2025 paper: "Fray: An Efficient General-Purpose Concurrency Testing Platform for the JVM".

We dive into:

• Why concurrency bugs remain so hard to catch -- even in "well-tested" Java projects.
• The design of Fray, a new concurrency testing platform that outperforms prior tools like JPF and rr.
• Real-world bugs discovered in Apache Kafka, Lucene, and Google Guava.
• The gap between academic research and industrial practice, and how Fray bridges it.
• What’s next for concurrency testing: debugging tools, distributed systems, and beyond.

If you’re a Java developer, systems researcher, or just curious about how to make software more reliable, this conversation is packed with insights on the future of software testing.

Links & Resources:

- The Fray paper (OOPSLA 2025):

- Fray on GitHub

- Ao Li’s research

- Rohan Padhye’s research

Don’t forget to like, subscribe, and hit the 🔔 to stay updated on the latest episodes about cutting-edge computer science research.

#Java #Concurrency #SoftwareTesting #Fray #OOPSLA2025 #Programming #Debugging #JVM #ComputerScience #ResearchPodcast

Hosted on Acast. See acast.com/privacy for more information.

In this episode, Bogdan Stoica, Postdoctoral Research Associate in the SysNet group at the University of Illinois Urbana-Champaign (UIUC) steps in to guest host. Bogdan sits down with Shrey Tiwari, a PhD student in the Software and Societal Systems Department at Carnegie Mellon University and member of the PASTA Lab, advised by Prof. Rohan Padhye. Together, they dive into Shrey’s award-winning research on date and time bugs in open-source Python software, exploring why these issues are so deceptively tricky and how they continue to affect systems we rely on every day.

The conversation traces Shrey’s journey from industry to research, including formative experiences at Citrix and Microsoft Research, and how those shaped his passion for software reliability. Shrey and Bogdan discuss the surprising complexity of date and time handling, the methodology behind Shrey’s empirical study, and the practical lessons developers can take away to build more robust systems. Along the way, they highlight broader questions about testing, bug detection, and the future role of AI in ensuring software correctness. This episode is a must-listen for anyone interested in debugging, reliability, and the hidden challenges that underpin modern software.

Links:

• It’s About Time: An Empirical Study of Date and Time Bugs in Open-Source Python Software 🏆 ACM SIGSOFT Distinguished Paper Award
• Shrey's homepage

Hosted on Acast. See acast.com/privacy for more information.

In this episode we are joined by Thaleia Doudali, Miguel Matos, and Anjo Vahldiek-Oberwagner to delve into five years of experience managing artifact evaluation at the EuroSys conference. They explain the goals and mechanics of artifact evaluation, a voluntary process that encourages reproducibility and reusability in computer systems research by assessing the supporting code, data, and documentation of accepted papers. The conversation outlines the three-tiered badge system, the multi-phase review process, and the importance of open-source practices. The guests present data showing increasing participation, sustained artifact availability, and varying levels of community engagement, underscoring the growing relevance of artifacts in validating and extending research.

The discussion also highlights recurring challenges such as tight timelines between paper acceptance and camera-ready deadlines, disparities in expectations between main program and artifact committees, difficulties with specialized hardware requirements, and lack of institutional continuity among evaluators. To address these, the guests propose early artifact preparation, stronger integration across committees, formalization of evaluation guidelines, and possibly making artifact submission mandatory. They advocate for broader standardization across CS subfields and suggest introducing a “Test of Time” award for artifacts. Looking to the future, they envision a more scalable, consistent, and impactful artifact evaluation process—but caution that continued growth in paper volume will demand innovation to maintain quality and reviewer sustainability.

Links:

• Lessons Learned from Five Years of Artifact Evaluations at EuroSys [DOI]
• Thaleia's Homepage
• Anjo's Homepage
• Miguel's Homepage

Hosted on Acast. See acast.com/privacy for more information.