Skip to content

The Dataflow Model Revisited Or: That Feeling When You Realize Every Problem You've Been Solving Is a Database Problem

Aug 2026 · Proceedings of the VLDB Endowment · Vol 19, pp. 4953-4964 · 0 citations · 32 references

TL;DR

How the completeness principle split into two successful forms: watermarks and snapshot-consistent refresh is explored, and it is traced why the latter reached far more users by asking far less of them, and generalize the former into declared constraints on change.

Abstract

Eleven years ago, the Dataflow Model paper argued that unbounded, out-of-order data was the new normal, and that we must stop waiting for data to ever become complete. It proposed a unified model (windowing, triggers, watermarks, and retractions) for freely trading off correctness, latency, and cost across batch and streaming engines. On the occasion of its VLDB Test of Time award, we grade our own work—a paper about streaming analytics, in truth if not in name— on what aged well, what aged badly, and what we missed. We find the paper's core foundations largely sound: the primacy of event time, the futility of waiting for completeness , and the insistence on strong consistency aged well. But we got important parts of the analytical interface wrong: (1) we let windowing and triggering, whose semantics were tangled with operational concerns, dominate the exposition beyond their due, (2) triggers were an over-engineered answer to a question users should never have faced, and (3) the stream-centric worldview missed a deeper truth: streams and tables are two representations of the same object with different access semantics. The mechanisms that delivered on the paper's analytical goals ultimately evolved out of the database playbook : SQL, incremental view maintenance, and materialized views with explicit freshness contracts. We focused too much on the mechanics of streaming instead of finishing what the database community started but never completed: making the complexity of analytical streaming disappear almost entirely. Still, the verdict is not all confession. We explore how the completeness principle split into two successful forms: watermarks (where streams stay visible) and snapshot-consistent refresh (where they do not); we trace why the latter reached far more users by asking far less of them, and generalize the former into declared constraints on change. We also (1) find the batch-versus-streaming debate was mostly semantic, (2) watch low-latency demand bifurcate along the old OLTP/OLAP line, leaving analytics happily at gentler freshness, (3) adopt the framing we wish we had started with (leave in, leave out, push harder), and (4) ponder the eventual disappearance of streaming beyond analytics.

View source

Similar papers

The Dataflow Model Revisited

It is explored how the completeness principle split into two successful forms: watermarks and snapshot-consistent refresh (where streams stay visible) and snapshot-consistent refresh (where they do not), and why the latter reached far more users by asking far less of them, and generalize the former into declared constr...

Tyler Akidau, Rafael J. Fernández-Moctezuma, Reuven Lax et al. · 0 citations
Preprint Sep 2026

ChurnBench: A Drift-Aware Benchmark Demonstrating That Refresh Scheduling, Not Cache Age, Governs Staleness in Agentic AI

In production, agentic systems answer questions over data that lives in several places and keeps changing: licenses are reassigned, users offboarded, prices changed, contracts renewed. Existing retrieval benchmarks freeze the data, so they cannot ask whether an agent's answer is still true, only whether it found the ri...

V. Singh, Preeti Priyam, Gautam Bhowmick · 0 citations
Preprint Aug 2026

LLM within MCP Matters: Measuring Inefficient Resource Utilization Driven by LLMs

Per-server prompt engineering is therefore a workaround rather than a fix; it is argued that MCP host applications should provide an explicit mechanism that places server instructions ahead of tool selection in the client LLM's deliberation.

Minhan Cho, Soyoung Park, Kihyeon Jeong et al. · 0 citations
Jul 2026

Fugue: Online Elasticity for Distributed Stateful Stream Processing

Fugue is a novel, self-contained reactive protocol that provides seamless and resource-efficient elasticity and reaches comparable handover performance while avoiding continuous replication overhead, and is implemented in Apache Flink.

Yu-Qiu Zhang, Yun-Hao Mao, Hans-Arno Jacobsen · 0 citations
Preprint Aug 2026

Time to Move on: Querying without Nulls and Bags

SQL is the database community's success story in terms of language design. The key reason for its success is its declarativeness: it gives rise to optimizability, reducing the programmer's burden significantly. However, given the evolving complexity of problems to solve with query languages, our community needs to re-t...

Molham Aref, Leonid Libkin, Wim Martens · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.