Imagination in Action · Published 2026-08-21

Do Databases Have a Future? | Conversations in Action

Open on YouTube ↗

Summary

Overview

  • Speaker: John Werner, Dr. Alex Wissner-Gross, and Michael Stonebraker
  • Channel: Imagination in Action
  • Main topic: The future of databases, relational models, foundational models, LLMs, and enterprise data architecture
  • Purpose: Analyze the long-term viability of relational databases in the age of LLMs and AI agents, examining data structure fundamentals, enterprise data challenges, and software architecture evolution. A deep technical conversation featuring Turing Award winner Michael Stonebraker, Dr. Alex Wissner-Gross, and John Werner discussing whether large language models and foundation models threaten the dominance of relational databases, why schema rot and data silos persist in enterprises, the limits of unstructured text in AI, and the historical lessons of database versus operating system design.

Topic Map

Introduction and Panel Setup

  • Explanation: John Werner introduces Dr. Alex Wissner-Gross and guest Michael Stonebraker, Turing Award winner and database pioneer.
  • Key claims:
    • Michael Stonebraker is a Turing Award winner and founder of multiple successful database companies.
    • Stonebraker is often viewed as a living founding father of modern database systems.
  • Examples:
    • Ingres, Postgres, Vertica, SciDB, and C-Store founding history.
  • Terminology:
    • Turing Award
    • relational database
    • founder
  • Why it matters: Establishes the pedigree of the guest and sets the stage for a foundational discussion on data systems.

LLMs and Foundation Models vs Relational Databases

  • Explanation: Alex Wissner-Gross asks whether LLMs and foundation models represent the first true exception to all alternative data structures collapsing into relational databases.
  • Key claims:
    • Essentially all data sources feeding agentic AI are relational underneath.
    • Treating data as raw text and performing joins via text-to-text generation throws away valuable structural information.
    • Foundation models are text-to-text only and lack rigorous structural query guarantees.
  • Examples:
    • Comparing programmatic joins on relational tables vs text-based stitching in LLMs.
  • Terminology:
    • relational model
    • LLM
    • foundation model
    • compressed knowledge
    • schema rot
  • Why it matters: Addresses the existential question of whether vector databases and LLMs replace traditional structured database management.

Enterprise Data Silos and Schema Rot

  • Explanation: Discussion of why enterprise databases suffer from schema rot and how real-world data integration remains difficult.
  • Key claims:
    • Data warehouses are never in the public domain and always behind strict firewalls.
    • Over time, overlapping semantics create schema rot in nearly all legacy warehouses.
    • Enterprise workflows are full of edge cases, disparate sources, and non-mnemonic column names.
  • Examples:
    • MIT data warehouse column naming conventions vs Spider and Bird benchmark datasets.
  • Terminology:
    • schema rot
    • data warehouse
    • semantic overlap
    • multitable join
  • Why it matters: Explains why AI models struggle with enterprise data tasks due to messy underlying corporate data structures.

Database Architecture vs Operating Systems: DBOS

  • Explanation: Michael Stonebraker discusses DBOS, a project arguing that operating systems should be built as applications running on top of databases.
  • Key claims:
    • Cloud infrastructure has outgrown 33-year-old Linux paradigms.
    • DBOS treats the operating system as an application running on a database, enabling durable workflows and transactional safety.
    • Venture capitalists backed DBOS on the premise that cloud-native architectures require database-backed primitives.
  • Examples:
    • Building scalable schedulers and state management with transactional ACID guarantees.
  • Terminology:
    • DBOS
    • operating system
    • ACID
    • transaction
    • durable workflow
  • Why it matters: Demonstrates ongoing radical innovation in database systems research applied to core infrastructure.

Open Source vs Proprietary Software in Databases

  • Explanation: Historical perspective on how open-source databases like PostgreSQL defeated proprietary vendors like Oracle.
  • Key claims:
    • PostgreSQL and Linux succeeded because they became open-source public domain goods owned by no single entity.
    • Oracle bought MySQL and acquired MySQL/SQL assets, causing developer communities to flee toward PostgreSQL.
    • Open-source data structures offer immense advantages over closed-source corporate lock-in.
  • Examples:
    • Postgres history, UC Berkeley origins, and Oracle acquisition fallout.
  • Terminology:
    • PostgreSQL
    • Oracle
    • open source
    • proprietary
    • licensing
  • Why it matters: Provides insight into long-term commercial and architectural sustainability of enterprise software.

Graph Databases vs Relational Databases

  • Explanation: Evaluation of graph databases and whether graph models offer fundamental advantages over relational tables.
  • Key claims:
    • Graph databases model data as edge tables and node tables, which are fundamentally relational.
    • When running queries finding the shortest path, tabular relational systems often outperform native graph implementations if properly indexed.
    • Most proposed data structures over the last 17 years (including graph databases) fail to provide fundamental advantages over relational databases.
  • Examples:
    • Neo4j vs relational table performance on graph traversal workloads.
  • Terminology:
    • graph database
    • node table
    • edge table
    • shortest path
    • Neo4j
  • Why it matters: Defends the enduring optimality of the relational model against specialized database fads.

Key Points

Relational Models Remain Foundational for AI

  • Explanation: All major data sources feeding advanced AI agents are relational underneath; ignoring structure in favor of pure text processing is inefficient.
  • Evidence: Stonebraker argues that text-to-text joining throws away explicit structural constraints.
  • Practical implication: AI agents operating on enterprise data need structured relational interfaces rather than flat text embeddings alone.

Enterprise Data Suffer from Severe Schema Rot

  • Explanation: Real-world corporate databases accumulate conflicting semantics, non-mnemonic identifiers, and data silos over decades.
  • Evidence: Enterprise data warehouses require complex multi-way joins across messy, uncurated schemas.
  • Practical implication: Fine-tuning models on public benchmarks does not prepare them for messy enterprise data environments.

Open Source Dominates Infrastructure Software

  • Explanation: Projects like PostgreSQL and Linux succeeded by remaining community-owned and unencumbered by corporate monopoly.
  • Evidence: PostgreSQL became the world's most used database after Oracle's commercial maneuvers drove developers away.
  • Practical implication: Infrastructure developers should prioritize open ecosystems to ensure developer adoption and longevity.

Graph Databases are Tabular Under the Hood

  • Explanation: Graph databases are conceptually equivalent to edge and node tables in a relational database.
  • Evidence: Queries on graph databases can be expressed as relational table joins.
  • Practical implication: Do not adopt specialized graph engines without evaluating whether relational systems with proper indexing suffice.

Frameworks, Models & Processes

DBOS (Database Operating System)

  • How it works: Replaces traditional OS state management with transactional database primitives, ensuring durable workflows and crash recovery.
  • Components:
    • Transactional database core
    • Durable workflow engine
    • State management layer
  • When to use: Cloud-native application infrastructure requiring high reliability and state persistence.

Relational Data Modeling

  • How it works: Organizes data into tables of rows and columns, enforcing atomicity, consistency, isolation, and durability (ACID).
  • Components:
    • Tables
    • Primary keys
    • Foreign keys
    • Joins
  • When to use: Structured enterprise data storage, transactional processing, and complex querying.

Examples & Case Studies

Municipal transportation department in Munich using Postgres/Ingres-derived tech for trolley scheduling.

  • Illustrates: Real-world application of agentic and database systems handling ambiguous human complaints and transit schedules.
  • Lesson: Handling real-world operational edge cases requires rigorous data structures beyond simple prompt responses.

Oracle acquiring MySQL and subsequently driving open-source developers to PostgreSQL.

  • Illustrates: The risk of proprietary ownership in open infrastructure software.
  • Lesson: Community-governed open-source software outlasts corporate proprietary control in foundational technology.

Actionable Takeaways

  • Immediate:
    • Recognize that graph databases are fundamentally relational table representations.
    • Understand that LLMs and foundation models process text rather than structured database schemas natively.
  • Strategic:
    • Prioritize open-source relational foundations like PostgreSQL for enterprise data architectures.
    • Anticipate the evolution of cloud operating systems toward database-backed primitives like DBOS.
  • Questions to investigate:
    • How will text-to-SQL agents handle enterprise schema rot at scale?
    • Can database-backed operating systems replace legacy Linux kernel architectures in production?

Claims Worth Verifying

  • PostgreSQL is the most used database on the planet. (market statistic)
  • Graph databases are equivalent to node and edge tables. (technical architecture)
  • DBOS treats the operating system as an application running on a database. (system design)

Notable Quotes

"Everyone I know is building agents. You've said today's agents are mostly read only. What breaks first when agents start writing to the world?" (at 0:13) "Well, if you ask me that question, I would say, well, health care and the building trades seem safe. Everything else seems to be a risk." (at 0:24) "My take is you should learn Chinese because I think we are like post-World War II Britain." (at 0:32) "Mike Stonebreaker is the closest thing software has to a living founding father." (at 2:29) "I'm not sure I'd recommend an 18 year old study computer science." (at 3:31) "You've spent decades talking about how every other model other than the relational model is being dissolved in some sense by relational." (at 5:03) "The fundamental data structure is simply compressed knowledge and it's usually end-to-end differentiable, but looks nothing like a relational model." (at 5:37) "If you generalize that slightly to agentic AI, then then essentially all the all the data sources are relational that feed agentic AI." (at 6:41) "They will get turned into text and you will do the join as a text." (at 7:27) "That throws away structure, which is clearly a terrible idea." (at 7:34) "If you want to join table to text, in my opinion, you're better off converting the text to or the document to a table and doing a table to table joint." (at 8:36) "One of their big flaws is that they are text text only." (at 8:59) "Mike, you launched DBOS 36 months ago with Mata Zaharia and raised $8.5 million on the argument that the cloud has outgrown three year old Linux." (at 55:26) "I think the quid keyboard is going to be with us through the heat death of the universe." (at 116:41)

Compressed Summary

  • Relational database structures remain superior to graph databases and text-based LLM architectures for structured data operations.
  • Enterprise data suffers from widespread schema rot and semantic overlap, posing a major challenge for AI agents.
  • PostgreSQL succeeded as an open-source standard by remaining independent of corporate monopoly.
  • DBOS represents a paradigm shift treating operating systems as applications built on databases.
  • Keywords: databases, relational, ai, opensource, architecture
  • Core insight: Despite the rise of LLMs and alternative data structures, the relational model remains the foundational bedrock of computing and AI data pipelines.

Core insights

4
Architecturemedium noveltymoderate evidence

Do not implement joins by asking an LLM to generate text over relational content. Text-to-text joining loses the structural constraints that make joins meaningful, and foundation models provide no rigorous query guarantees, so the reliable architecture is to use LLMs for natural language translation/planning and let a relational engine execute the resulting query.

Why it matters

Agentic systems that stitch data across documents/tables in prompt context are vulnerable to plausible but structurally invalid combinations; preserving a deterministic query path is necessary where correctness of the join matters.

Generalization

If a subproblem can be solved by a deterministic engine with formal semantics, assign the deterministic engine the operation and use the LLM only for translation, generation, or summarization.

Treating data as raw text and performing joins via text-to-text generation throws away valuable structural information.
Open source video
Foundation models are text-to-text only and lack rigorous structural query guarantees.
Open source video
Failure Modehigh noveltymoderate evidence

The gap between benchmark performance and enterprise performance of data agents is caused by schema rot. Public cross-database benchmarks like Spider/Bird have curated schemas; enterprise warehouses accumulate non-mnemonic columns, overlapping semantics, and edge cases, so an LLM that performs well on clean benchmarks may still fail on production data.

Why it matters

Evaluation with public benchmarks does not transfer to the messy relational schemas an agent will actually traverse; engineering evaluations need to include realistic schema rot.

Generalization

Benchmarks or data sets are part of the test-time distribution; if the deployment data has legacy naming and semantic duplication, include those artifacts in evaluation before trusting model performance.

Enterprise workflows are full of edge cases, disparate sources, and non-mnemonic column names.
Open source video
Over time, overlapping semantics create schema rot in nearly all legacy warehouses.
Open source video
Mental Modelhigh noveltymoderate evidence

Graph databases are not a fundamental departure from the relational model: a graph is a set of node tables and edge tables. When indexes are set up properly, relational systems can outperform native graph implementations on graph traversal workloads such as shortest path.

Why it matters

Adding a graph store to an AI/data stack is not automatically a capabilities upgrade; the modeling is reducible to relations, and physical performance must be benchmarked before adopting specialized infrastructure.

Generalization

When a proposed new data abstraction is expressible as existing table structures, its value is physical/ergonomic, not semantic; quantify query performance and operational cost before adding a new store.

Graph databases model data as edge tables and node tables, which are fundamentally relational.
Open source video
When running queries finding the shortest path, tabular relational systems often outperform native graph implementations if properly indexed.
Open source video
Architecturehigh noveltyweak evidence

Durable, crash-safe workflow state is better obtained by building workflow/orchestration software as an application on a transactional database (DBOS style) instead of layering scheduling and state management on top of legacy OS assumptions.

Why it matters

For long-running and multi-step agent workflows, state loss and inconsistent side effects are operational hazards; transactional database primitives give ACID durability to the workflow itself.

Generalization

The state machine of a long-running process should live in a transaction-capable data store, not in ephemeral memory or external non-transactional queues.

DBOS treats the operating system as an application running on a database, enabling durable workflows and transactional safety.
Open source video

Deep dives

4

Delegation boundary between LLM text joining and relational query execution

Research question

Under what data conditions and accuracy requirements should an agent use programmatic relational joins instead of LLM text-to-text joining, and can we quantify the correctness/cost tradeoff?

Why

Agentic systems that stitch data across documents and tables in prompt context are vulnerable to plausible but structurally invalid combinations; a deterministic query path is necessary where join correctness matters.

Treating data as raw text and performing joins via text-to-text generation throws away valuable structural information.
Open source video
Foundation models are text-to-text only and lack rigorous structural query guarantees.
Open source video
Source video

Synthetic schema rot for predicting enterprise data-agent performance

Research question

Can we synthesize enterprise-like schema rot, including non-mnemonic names, legacy aliases, and overlapping semantics, and use it to predict real-world data-agent quality degradation before deployment?

Why

Public cross-database benchmarks have clean curated schemas, so they systematically overestimate performance on production warehouses full of schema rot and edge cases.

Enterprise workflows are full of edge cases, disparate sources, and non-mnemonic column names.
Open source video
Over time, overlapping semantics create schema rot in nearly all legacy warehouses.
Open source video
Source video

Graph workloads on well-indexed relational engines versus native graph engines

Research question

For which graph query classes, scales, and workloads do well-indexed relational systems outperform native graph implementations, and where does the native graph advantage remain?

Why

Graph databases are frequently added to AI/data stacks, but their data model is reducible to relational node and edge tables; adding a specialized store should require measured performance evidence, not assumed superiority.

Graph databases model data as edge tables and node tables, which are fundamentally relational.
Open source video
When running queries finding the shortest path, tabular relational systems often outperform native graph implementations if properly indexed.
Open source video
Source video

Transactional durable workflow state for long-running AI agents

Research question

Can workflow and orchestration software built as an application on a transactional database deliver crash-safe, exactly-once progress semantics for multi-step agent workflows at acceptable latency?

Why

Long-running agent workflows depend on durable state and consistent side effects, yet many schedulers still assume legacy OS persistence boundaries and can lose or duplicate progress on failure.

DBOS treats the operating system as an application running on a database, enabling durable workflows and transactional safety.
Open source video
Source video

Article ideas

4

Your AI Agents Can't Join Tables by Reading Text

LLMs should not be used as relational join engines; production AI systems should let deterministic relational engines execute joins and use LLMs only for translation, planning, and explanation.

Angle

An architecture anti-pattern article focused on the structural guarantees lost when text-to-text stitching replaces programmatic joins.

Source video

The Spider/Bird Performance Mirage

Clean public text-to-SQL benchmark scores are poor predictors of enterprise data-agent performance because they omit schema rot; evaluation suites must encode production warehouse messiness before deployment claims are credible.

Angle

An evaluation-critique article connecting schema rot to misleading benchmark deltas.

Source video

Graph Databases Are Beautiful Relations Until You Benchmark Them

Most graph database use cases are just node tables and edge tables, so the burden of proof for adopting a graph database is measured query performance on your actual workload, not a belief that graph semantics require a new engine.

Angle

An engineering-decision article challenging the default addition of graph stores to AI/data stacks.

Source video

The Database Is the Operating System for Durable Agents

Long-running and multi-step AI agents need crash-safe workflow state, and the most reliable place to build that state machine is a transactional database, not ephemeral memory or non-transactional queues.

Angle

An architecture-position article arguing that agent orchestration should follow DBOS-style design and treat persistent transactional storage as the root of workflow guarantees.

Source video

Project ideas

4

Text-to-Text Join vs Relational Execute Benchmark

beyond-evals

On a fixed multi-table enterprise-like dataset, when natural-language requests require foreign-key joins, LLM text-to-text stitching produces fewer correct linked record pairs than SQL generated by an LLM and executed in a relational engine.

Proof of concept

Build a small benchmark with normalized tables and natural-language queries requiring multi-table joins; compare (a) an LLM receiving raw text of all rows and answering in text with (b) the same LLM generating SQL executed by a relational engine.

Measurement

F1 or precision/recall of answer record pairs, with cost and latency per query.

Source video

RotBench: Schema-Rot-Aware Data Agent Evaluation

beyond-evals

Applying automated schema-rot transformations to a clean benchmark schema produces a statistically significant drop in text-to-SQL execution accuracy relative to the same model on the clean schema.

Proof of concept

Create a mutation library that renames columns to non-mnemonic codes, introduces semantically overlapping aliases, and adds legacy edge cases; run one open text-to-SQL model on clean and mutated schema variants with matching queries.

Measurement

Execution accuracy, exact-set match, and end-to-end task success across clean versus mutated schemas.

Source video

DurableAgentFlow: Transactional Workflow Recovery

new

A workflow state store built as an application on a transactional database can recover a multi-step agent run to its last completed step after a sudden process kill, while an in-memory baseline loses all progress.

Proof of concept

Implement a minimal two-step agent workflow with state stored in a transactional table; simulate process failure after step one and compare recovery with an in-memory state scheduler.

Measurement

Recovery completeness, exactly-once execution of side effects, and recovery latency.

Source video

Relational Graph Speed Audit

movement-lab

For shortest-path style traversal on moderately sized graphs, a relational engine with appropriate indexes is at least as fast as a native graph engine, while remaining operationally simpler in a stack that already contains a database.

Proof of concept

Load the same node/edge tables into a relational engine and a lightweight graph engine; run identical shortest-path queries with a fixed hardware/compute budget.

Measurement

Query latency and throughput, plus developer/operational complexity measured by lines of setup code.

Source video

Architectural implications

4

Current agentic designs often pass raw text from multiple sources into an LLM context to combine or join them.

Before

Text-to-text generation and unstructured context are used for joins and relationship discovery.

After

Use an LLM to parse natural-language data requests and translate to SQL or graph queries, then execute joins in the relational engine and use LLM only to synthesize explanations.

Consequence

Joins gain structural guarantees; the LLM becomes an interface rather than a query engine, reducing false relational associations.

Source video

Most text-to-SQL/data agent evaluations use clean public repositories; enterprise schemas contain schema rot.

Before

Progress is assessed on Spider/Bird-style normalized schemas, implicitly assuming enterprise behavior.

After

Build a private eval corpus from an internal warehouse, including non-mnemonic names, overlapping semantics, and edge cases.

Consequence

Teams can detect overfitting to clean schemas and compare designs on data resembling production.

Source video

Engineering teams add Graph databases for relationship-oriented data in AI systems.

Before

Graph traversal is sent to a dedicated graph engine because the domain is thought to require a non-relational structure.

After

Model the data as relation node/edge tables in the existing database and index properly; benchmark both options before building a specialized path.

Consequence

Many use cases can be served by one relational engine, reducing data movement and system diversity; specialized graphs are chosen only when actual performance demands.

Source video

Schedulers and workflow managers for long-running agent processes assume traditional OS persistence boundaries.

Before

Workflow state and job progress live in application memory or external non-transactional stores; a crash can leave incomplete steps or duplicate side effects.

After

Design the orchestrator as a thin app on a transactional database with ACID durable workflows, as DBOS proposes.

Consequence

Multi-step agent executions can survive process/node failures with exactly-once progress semantics and transactional safety.

Source video

Tradeoffs and failure modes

3

LLM text-to-text joins

Benefit

Enables flexible natural-language access to data without engineering a query plan, and works even when schema is unknown.

Cost or risk

Throws away structural constraints and lacks query guarantees, so incorrect or hallucinated joins can be produced with high confidence.

Treating data as raw text and performing joins via text-to-text generation throws away valuable structural information.
Open source video
Source video

Public benchmark evaluation for enterprise data agents

Benefit

Clean standardized schemas make progress comparisons reproducible and easy.

Cost or risk

Omits schema rot and non-mnemonic naming; results overstate production data performance.

Enterprise workflows are full of edge cases, disparate sources, and non-mnemonic column names.
Open source video
Source video

Adopting a graph database

Benefit

Domain-specific modeling can make relationships/navigation easier to express.

Cost or risk

Graph data is still relational under the hood and can be slower than indexed relational execution for traversal queries, adding another system without semantic advantage.

Most proposed data structures over the last 17 years (including graph databases) fail to provide fundamental advantages over relational databases.
Open source video
Source video

Open questions

5

When could LLM text-to-text joining over unstructured sources be acceptable, and when is deterministic SQL execution necessary?

Why unresolved

Foundation models have no formal structural guarantees, but many real workflows tolerate ambiguity or have no usable relational schema.

Research direction

Benchmark text stitching vs programmatic relational joins on same enterprise data, measuring precision/recall of linked records and cost.

Source video

Can schema rot be synthesized into benchmarks to predict enterprise data-agent performance?

Why unresolved

Real enterprise warehouses sit behind firewalls and accumulate semantics/naming that public benchmarks lack.

Research direction

Generate schemas with inconsistent column aliases, overlapping definitions, and legacy non-mnemonic names; measure drop in model quality against clean schemas.

Source video

For which query classes do native graph engines actually beat well-indexed relational systems?

Why unresolved

The summary claims relational can outperform on shortest-path, but that single example may not generalize to all graph analytics.

Research direction

Controlled comparison of relational (with path/recursive queries) vs native graph engines across traversal, multi-hop, and analytic workloads.

Source video

What workload envelope makes an OS built on a database (DBOS) viable?

Why unresolved

The DBOS premise is described as a design backed by VCs, not as a demonstrated production OS benchmark.

Research direction

Prototype schedulers and workflow services on transactional database storage and measure latency/throughput against conventional OS service implementations.

Source video

Are vector databases another example of a data structure that collapses into relation tables, or a real exception?

Why unresolved

The summary raises the vector vs relational question in context of LLMs but does not evaluate vector stores as a database model.

Research direction

Formalize vector retrieval as a relational operation with approximate indexes and compare semantic retrieval accuracy/performance.

Source video

Key claims

6
causalVerification needed

Treating data as raw text and performing joins via text-to-text generation throws away valuable structural information.

Evidence

Treating data as raw text and performing joins via text-to-text generation throws away valuable structural information.

Question

Can a controlled experiment show that programmatic relational joins outperform LLM text stitching when structural constraints are essential?

Source video
comparativeVerification needed

Foundation models are text-to-text only and lack rigorous structural query guarantees.

Evidence

Foundation models are text-to-text only and lack rigorous structural query guarantees.

Question

What formal notion of a query guarantee could be checked for LLM outputs, and how do current models fail it?

Source video
opinionVerification needed

Essentially all data sources feeding agentic AI are relational underneath.

Evidence

Essentially all data sources feeding agentic AI are relational underneath.

Question

Which common agentic data feeds are not representable as relations, and what is the underlying storage model in each case?

Source video
comparativeVerification needed

Graph databases model data as edge tables and node tables, which are fundamentally relational.

Evidence

Graph databases model data as edge tables and node tables, which are fundamentally relational.

Question

Can any graph feature or operation be expressed without adding non-relational storage semantics on top of tables?

Source video
comparativeVerification needed

When running queries finding the shortest path, tabular relational systems often outperform native graph implementations if properly indexed.

Evidence

When running queries finding the shortest path, tabular relational systems often outperform native graph implementations if properly indexed.

Question

On which datasets, indexes, and query algorithms was this comparison observed?

Source video
causalVerification needed

PostgreSQL became the world's most used database after Oracle's commercial maneuvers drove developers away.

Evidence

PostgreSQL became the world's most used database after Oracle's commercial maneuvers drove developers away.

Question

What database market-share data supports the causal link between Oracle acquisitions and PostgreSQL adoption?

Source video

Connections

5