BlendSQL: A Scalable Dialect for Unifying Hybrid Question Answering in Relational Algebra
Parker Glenn, Parag Pravin Dakle, Liang Wang, Preethi Raghavan
TL;DR
BlendSQL introduces a scalable SQL-like intermediate representation to unify reasoning across structured and unstructured data for hybrid question answering. The framework uses a Blender and Parser to compose LLM-powered ingredients (LLMMap, LLMQA, LLMJoin) into a unified query against a SQLite-like database, returning a smoothie object with final results and intermediate steps. With a small set of few-shot exemplars, BlendSQL achieves competitive results on HybridQA, OTT-QA, and FEVEROUS while reducing prompt tokens by approximately 35%, and enables interpretable intermediate reasoning through its script. The work provides open-source code and demonstrates practical, explainable, scalable hybrid QA suitable for large datasets and diverse data sources.
Abstract
Many existing end-to-end systems for hybrid question answering tasks can often be boiled down to a "prompt-and-pray" paradigm, where the user has limited control and insight into the intermediate reasoning steps used to achieve the final result. Additionally, due to the context size limitation of many transformer-based LLMs, it is often not reasonable to expect that the full structured and unstructured context will fit into a given prompt in a zero-shot setting, let alone a few-shot setting. We introduce BlendSQL, a superset of SQLite to act as a unified dialect for orchestrating reasoning across both unstructured and structured data. For hybrid question answering tasks involving multi-hop reasoning, we encode the full decomposed reasoning roadmap into a single interpretable BlendSQL query. Notably, we show that BlendSQL can scale to massive datasets and improve the performance of end-to-end systems while using 35% fewer tokens. Our code is available and installable as a package at https://github.com/parkervg/blendsql.
