arXiv · 2608.30291
PEARL: Front-Loading Relational Chains for Multi-Hop Table Retrieval
Abstract
While large language models (LLMs) have shown strong capabilities in tabular reasoning, retrieving relevant tables remains challenging due to the fragmented and relational structure of real-world data. Existing work typically relies on whole table representations that overlook cross-table semantics induced by join relationships. We propose PEARL, a training-free framework that shifts the paradigm toward vertical partitioning-based sub-table encoding. PEARL augments the retrieval corpus offline by generating multi-hop queries over pre-identified join paths and reorganizing relevant columns into vertically partitioned corpus units, enabling effective multi-table retrieval without query-time LLM inference. Experiments show that PEARL consistently outperforms existing methods, with up to +30.05% gains in R@2 on 3-hop queries. The source code is available at https://github.com/SOOB2NHO/PEARL.
Explore related subjects
Keep this discovery
Subeen Ho, Hyeongu Kang, SeongKu Kang, Susik Yoon. 2026-08-31. PEARL: Front-Loading Relational Chains for Multi-Hop Table Retrieval. https://arxiv.org/abs/2608.30291
Cite the original work for its findings. Save a collection to share your selection of sources.
Discover connections
Connections use source metadata and explicit phrase matches, not verified experimental comparisons.