dorsal/arxiv
View SchemaTask Cascades for Efficient Unstructured Data Processing
| Authors | Shreya Shankar, Sepanta Zeighami, Aditya Parameswaran |
|---|---|
| Categories | |
| ArXiv ID | 2601.05536vv1 |
| URL | https://arxiv.org/abs/2601.05536 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Modern database systems allow users to query or process unstructured text or document columns using LLM-powered functions. Users can express an operation in natural language (e.g., "identify if this review mentions billing issues"), with the system executing the operation on each document, in a row-by-row fashion. One way to reduce cost on a batch of documents is to employ the model cascade framework: a cheap proxy model processes each document, and only uncertain cases are escalated to a more accurate, expensive oracle. However, model cascades miss important optimization opportunities; for example, often only part of a document is needed to answer a query, or other related, but simpler operations (e.g., "is the review sentiment negative?", "does the review mention money?") can be handled by cheap models more effectively than the original operation, while still being correlated with it. We introduce the task cascades framework, which generalizes model cascades by varying not just the model, but also the document portion and operation at each stage. Our framework uses an LLM agent to generate simplified, decomposed, or otherwise related operations and selects the most relevant document portions, constructing hundreds of candidate tasks from which it assembles a task cascade. We show that optimal cascade selection is intractable via reduction from Minimum Sum Set Cover, but our iterative approach constructs effective cascades. We also provide an extension that offers statistical accuracy guarantees: the resulting cascade meets a user-defined accuracy target (with respect to the oracle) up to a bounded failure probability. Across eight real-world document processing tasks at a 90% target accuracy, task cascades reduce end-to-end cost by an average of 36% compared to model cascades, at a production scale.
{
"annotation_id": "ed9dd33b-19d8-45ba-9b68-49fa6139e80d",
"date_created": "2026-02-17T05:53:05.049000Z",
"date_modified": "2026-02-17T05:53:05.049000Z",
"file_hash": "2177211052c22e65bc65a832e593335521eb32e648aa5d2a01d9d80e0c998109",
"private": false,
"record": {
"abstract": "Modern database systems allow users to query or process unstructured text or document columns using LLM-powered functions. Users can express an operation in natural language (e.g., \"identify if this review mentions billing issues\"), with the system executing the operation on each document, in a row-by-row fashion. One way to reduce cost on a batch of documents is to employ the model cascade framework: a cheap proxy model processes each document, and only uncertain cases are escalated to a more accurate, expensive oracle. However, model cascades miss important optimization opportunities; for example, often only part of a document is needed to answer a query, or other related, but simpler operations (e.g., \"is the review sentiment negative?\", \"does the review mention money?\") can be handled by cheap models more effectively than the original operation, while still being correlated with it.\n We introduce the task cascades framework, which generalizes model cascades by varying not just the model, but also the document portion and operation at each stage. Our framework uses an LLM agent to generate simplified, decomposed, or otherwise related operations and selects the most relevant document portions, constructing hundreds of candidate tasks from which it assembles a task cascade. We show that optimal cascade selection is intractable via reduction from Minimum Sum Set Cover, but our iterative approach constructs effective cascades. We also provide an extension that offers statistical accuracy guarantees: the resulting cascade meets a user-defined accuracy target (with respect to the oracle) up to a bounded failure probability. Across eight real-world document processing tasks at a 90% target accuracy, task cascades reduce end-to-end cost by an average of 36% compared to model cascades, at a production scale.",
"arxiv_id": "2601.05536",
"authors": [
"Shreya Shankar",
"Sepanta Zeighami",
"Aditya Parameswaran"
],
"categories": [
"cs.DB"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Task Cascades for Efficient Unstructured Data Processing",
"url": "https://arxiv.org/abs/2601.05536",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "2a5110fc-810c-4e61-8d43-edf5ce48c937",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}