ProSPy: A Profiling-Driven SQL-Python Agentic Framework for Enterprise Text-to-SQL
- URL: http://arxiv.org/abs/2606.05836v1
- Date: Thu, 04 Jun 2026 08:13:05 GMT
- Title: ProSPy: A Profiling-Driven SQL-Python Agentic Framework for Enterprise Text-to-SQL
- Abstract summary: ProSPy is a Profiling-driven framework for enterprise-scale Text-to-gnostic analysis.<n>ProSPy structures the reasoning process into four stages.<n>It first extracts fine-grained data evidence through automatic profiling.<n>It prunes large schemas into task-relevant contexts.
- Score: 51.98164069124653
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Large language models have substantially advanced Text-to-SQL systems, yet applying them to enterprise-scale databases remains challenging. Real-world databases often contain large and heterogeneous schemas, incomplete metadata, dialect-specific SQL syntax, and complex analytical questions that are difficult to solve with a single SQL query. To address these challenges, we propose ProSPy, a Profiling-driven SQL--Python agentic framework for enterprise-scale Text-to-SQL. ProSPy structures the reasoning process into four stages: it first extracts fine-grained data evidence through automatic profiling, progressively prunes large schemas into task-relevant contexts, fetches intermediate views through a dialect-agnostic SQL interface, and finally performs flexible downstream analysis with Python. This design combines the efficiency of SQL over large databases with the flexibility of Python-based analysis, while reducing reliance on unreliable metadata and improving robustness across SQL dialects. Experiments on Spider 2.0-Lite and Spider 2.0-Snow show that ProSPy consistently outperforms strong baselines with both open-source and proprietary models, achieving execution accuracies of 60.15% and 60.51% with Claude-4.5-Opus, without majority voting. Further analysis shows that ProSPy is robust to SQL dialect variations and achieves a favorable trade-off between schema recall and precision.
Related papers
- Spider 2.0-AIFunc: Extending Real-World Text-to-SQL to AI-Native SQL Workflows [54.49251107006261]
We introduce Spider 2.0-AIFunc, a benchmark of 465 verified instances across 125 real-world databases covering six types of AI functions on the Snowflake platform.<n>We find that the strongest proprietary models reach 67-70% execution accuracy while the best open-source model achieves 58.1%.
arXiv Detail & Related papers (2026-07-07T12:54:08Z) - AV-SQL: Decomposing Complex Text-to-SQL Queries with Agentic Views [40.813123705793764]
We introduce AV-, a framework that decomposes complex Text-to-LLMs into specialized agents.<n> AV- operates in three stages: (1) a rewriter agent compresses and clarifies the input query; (2) a view agent processes chunks to produce agentic views; and (3) a planner, generator, and revisor agent collaboratively generates the views into the final query.
arXiv Detail & Related papers (2026-04-08T12:56:13Z) - Benchmarking Text-to-Python against Text-to-SQL: The Impact of Explicit Logic and Ambiguity [5.794032059676749]
We introduce BIRD-Python, a benchmark designed for cross-paradigm evaluation.<n>We show that Python requires explicit procedural logic, making it highly sensitive to under user intent.<n>We propose the Logic Completion Framework (LCF), which resolves ambiguity by incorporating latent domain knowledge into the generation process.
arXiv Detail & Related papers (2026-01-22T07:54:45Z) - SQaLe: A Large Text-to-SQL Corpus Grounded in Real Schemas [2.905751301655124]
Key bottleneck for developing text-to-hugging models is lack of large-scale datasets with sufficient schema and query complexity, domain coverage, and task diversity.<n>We introduce SQaLe: a large-scale semi-synthetic text-to-hugging dataset built on 135,875 relational database schemas expanded from a collection of real-world schemas,Pile.<n>SQaLe captures realistic schema size variability, diverse query patterns, and natural language ambiguity while maintaining execution validity.
arXiv Detail & Related papers (2025-12-16T09:15:10Z) - Text-to-SQL as Dual-State Reasoning: Integrating Adaptive Context and Progressive Generation [54.53145282349042]
We introduce DSR-sourced, a textbfDual-textbfS textbfReasoning framework that models Text-to-context as an interaction between an adaptive context state and a progressive generation state.<n>Without any post-training or in-context examples, DSR-sourced achieves competitive performance, reaching 35.28% execution accuracy on Spider 2.0-Snow and 68.32% on BIRD development set.
arXiv Detail & Related papers (2025-11-26T13:52:50Z) - STARQA: A Question Answering Dataset for Complex Analytical Reasoning over Structured Databases [27.66819120859756]
We introduce STARQA, the first public human-created dataset of complex analytical reasoning questions and answers on three specialized relational-domain databases.<n>In this paper, we introduce STARQA, the first public human-created dataset of complex analytical reasoning questions and answers on three specialized relational-domain databases.
arXiv Detail & Related papers (2025-09-23T19:26:16Z) - Spider 2.0: Evaluating Language Models on Real-World Enterprise Text-to-SQL Workflows [64.94146689665628]
Spider 2.0 is an evaluation framework for real-world text-to-sql problems derived from enterprise-level database use cases.<n>The databases in Spider 2.0 are sourced from real data applications, often containing over 1,000 columns and stored in local or cloud database systems such as BigQuery and Snowflake.<n>We show that solving problems in Spider 2.0 frequently requires understanding and searching through database metadata, dialect documentation, and even project-levels.
arXiv Detail & Related papers (2024-11-12T12:52:17Z) - E-SQL: Direct Schema Linking via Question Enrichment in Text-to-SQL [1.187832944550453]
We introduce E-Seek, a novel pipeline specifically designed to address these challenges through direct schema linking and candidate predicate augmentation.<n>E-Seek enhances the natural language query by incorporating relevant database items (i.e., tables, columns, and values) and conditions directly into the question andsql construction plan, bridging the gap between the query and the database structure.<n> Comprehensive evaluations illustrate that E-Seek achieves competitive performance, particularly excelling in complex queries with a 66.29% execution accuracy on the test set.
arXiv Detail & Related papers (2024-09-25T09:02:48Z) - MAC-SQL: A Multi-Agent Collaborative Framework for Text-to-SQL [47.120862170230566]
Recent Text-to-yourself methods usually suffer from significant performance degradation on "huge" databases.<n>We introduce MAC, a novel Text-to-yourself LLM-based multi-agent collaborative framework.<n>In our framework, we leverage GPT-4 as the strong backbone for all agent tasks to determine the upper bound of our framework.<n>We then fine-tune an open-sourced instruction-followed model,sql-Llama, by leveraging Code 7B, to accomplish all tasks as GPT-4 does.
arXiv Detail & Related papers (2023-12-18T14:40:20Z) - SQL-PaLM: Improved Large Language Model Adaptation for Text-to-SQL (extended) [53.95151604061761]
This paper introduces the framework for enhancing Text-to- filtering using large language models (LLMs)
With few-shot prompting, we explore the effectiveness of consistency decoding with execution-based error analyses.
With instruction fine-tuning, we delve deep in understanding the critical paradigms that influence the performance of tuned LLMs.
arXiv Detail & Related papers (2023-05-26T21:39:05Z) - UNITE: A Unified Benchmark for Text-to-SQL Evaluation [72.72040379293718]
We introduce a UNIfied benchmark for Text-to-domain systems.
It is composed of publicly available text-to-domain datasets and 29K databases.
Compared to the widely used Spider benchmark, we introduce a threefold increase in SQL patterns.
arXiv Detail & Related papers (2023-05-25T17:19:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.