SteinerSQL: Graph-Guided Mathematical Reasoning for Text-to-SQL Generation
By: Xutao Mao, Tao Liu, Hongying Zan
Potential Business Impact:
Helps computers understand complex questions about data.
Large Language Models (LLMs) struggle with complex Text-to-SQL queries that demand both sophisticated mathematical reasoning and intricate schema navigation. Existing methods often tackle these challenges in isolation, creating a fractured reasoning process that compromises logical and structural correctness. To resolve this, we introduce SteinerSQL, a framework that unifies these dual challenges into a single, graph-centric optimization problem. SteinerSQL operates in three stages: mathematical decomposition to identify required tables (terminals), optimal reasoning scaffold construction via a Steiner tree problem, and multi-level validation to ensure correctness. On the challenging LogicCat and Spider2.0-Lite benchmarks, SteinerSQL establishes a new state-of-the-art with 36.10% and 40.04% execution accuracy, respectively, using Gemini-2.5-Pro. Beyond accuracy, SteinerSQL presents a new, unified paradigm for Text-to-SQL, paving the way for more robust and principled solutions to complex reasoning tasks.
Similar Papers
STaR-SQL: Self-Taught Reasoner for Text-to-SQL
Computation and Language
Helps computers understand questions to find data.
SchemaGraphSQL: Efficient Schema Linking with Pathfinding Graph Algorithms for Text-to-SQL on Large-Scale Databases
Computation and Language
Helps computers understand questions to find data.
Sparks of Tabular Reasoning via Text2SQL Reinforcement Learning
Computation and Language
Teaches computers to understand and use data tables.