BranchBench: Aligning Database Branching with Agentic Demands
Elaine Ang, Sam Weldon, In Keun Kim, Kevin Durand, Kostis Kaffes, Eugene Wu

TL;DR
BranchBench introduces a benchmark to evaluate relational databases for agentic workloads involving speculative mutations and non-linear exploration, revealing fundamental trade-offs and scalability issues.
Contribution
This paper presents BranchBench, a new benchmark for branchable relational DBMSes tailored to agentic workloads, and evaluates existing systems highlighting their limitations.
Findings
Fast-branching systems have 5-4000x slower reads on deep branches.
Optimized data operation systems have 25-1500x higher branch creation latency.
No current system supports representative workloads at scale.
Abstract
Branchable databases are evolving from developer tools to infrastructure for agentic workloads characterized by speculative mutations and non-linear state exploration. Traditional RDBMS mechanisms such as nested transactions do not provide the persistent isolation and concurrent branch management required by autonomous agents, and recent "zero-copy" designs make different trade-offs whose impact on agentic workloads remains unclear. To clarify this space, we present BranchBench, a benchmark for evaluating branchable relational DBMSes under agentic exploration. We characterize five representative workloads-agentic software engineering, failure reproduction, data curation, MCTS, and simulation-and design parameterized macrobenchmarks that execute branch-mutate-evaluate loops to reflect these workloads, along with microbenchmarks that isolate branch lifecycle costs. We evaluate state of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
