MEGA Hub

Carnot: Interpretable, Interactive, and Optimized Execution of Deep Research Queries

Authors

Do you know Matthew Russo?You can claim authorship or link another user.Do you know Yash Agarwal?You can claim authorship or link another user.Do you know Tianyu Li?You can claim authorship or link another user.Do you know Zhuohan Gu?You can claim authorship or link another user.Do you know Michael Cafarella?You can claim authorship or link another user.Do you know Omar Khattab?You can claim authorship or link another user.Do you know Tim Kraska?You can claim authorship or link another user.Do you know Samuel Madden?You can claim authorship or link another user.

Abstract

Enterprises increasingly seek to query data lakes using natural language via AI-driven tools like semantic operators or deep research agents. However, the latter operates as an opaque black box, hiding its intermediate reasoning and data retrieval steps, and failing to expose controls for managing API costs and execution latency. Meanwhile, the former can be prohibitively expensive for enterprise-scale data lakes. Consequently, analysts using these systems lack the agency to intercept hallucinated premises, verify intermediate results, or correct the system's trajectory. We present Carnot, an interactive execution engine for AI-driven analytics. Carnot compiles natural language requests into physical execution graphs and surfaces them through an interactive notebook interface. Rather than waiting blindly for a final output, users can critique the plan, incrementally execute operators, inspect intermediate data, or directly edit the underlying code or semantic operator instructions. Carnot's query optimizer will optimize the query with respect to cost or latency constraints provided by the user. Our demo will showcase how Carnot helps users achieve efficient and verifiable insights on workloads motivated by real enterprise use cases.

Community

00

Publication notes

Author note
4 pages, 2 figures, published as a demo paper in VLDB 2026
Journal
Proceedings of the VLDB Endowment, Vol. 19, No. 12 pages 4642 - 4645, 2026
DOI
10.14778/3827998.3828086