mlsanityData to 7 Oct 2026

Bauplan: zero-copy, scale-up FaaS for data pipelines

arXiv 2410.17465 ↗First posted 22 Oct 2024cs.DB cs.LG cs.OScited by 2

Not on the map. Why?

Abstract (arXiv)

Chaining functions for longer workloads is a key use case for FaaS platforms in data applications. However, modern data pipelines differ significantly from typical serverless use cases (e.g., webhooks and microservices); this makes it difficult to retrofit existing pipeline frameworks due to structural constraints. In this paper, we describe these limitations in detail and introduce bauplan, a novel FaaS programming model and serverless runtime designed for data practitioners. bauplan enables users to declaratively define functional Directed Acyclic Graphs (DAGs) along with their runtime environments, which are then efficiently executed on cloud-based workers. We show that bauplan achieves both better performance and a superior developer experience for data workloads by making the trade-off of reducing generality in favor of data-awareness

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 8 of its 24 references that are in the map. First posted on arXiv 22 Oct 2024.

Builds on

8 of 24 references.

References · 8

  1. 2022Operationalizing Machine Learning: An Interview Studycited by 25
  2. 2020Towards Scalable Dataframe Systemscited by 17
  3. 2018How Developers Iterate on Machine Learning Workflows -- A Survey of the Applied Machine Learning Literaturecited by 6
  4. 2023Building a serverless Data Lakehouse from spare partscited by 6
  5. 2024Reproducible data science over data lakes: replayable data pipelines with Bauplan and Nessiecited by 5
  6. 2019Formal Foundations of Serverless Computingcited by 3
  7. 2024An Empirical Study of Developers' Challenges in Implementing Workflows as Code: A Case Study on Apache Airflowcited by 3
  8. 2020Triggerflow: Trigger-based Orchestration of Serverless Workflowscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.