PEARL: Front-Loading Relational Chains for Multi-Hop Table Retrieval

Subeen Ho, Hyeongu Kang, SeongKu Kang, Susik Yoon


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
Anthology ID:
2026.emnlp-main.2549
Volume:
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Month:
October
Year:
2026
Address:
Budapest, Hungary
Editors:
Hung-Yi Lee, Sunipa Dev, Jessy Li, Desmond Elliott
Venue:
EMNLP
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
57952–57976
Language:
URL:
https://aclanthology.org/2026.emnlp-main.2549/
DOI:
Bibkey:
Cite (ACL):
Subeen Ho, Hyeongu Kang, SeongKu Kang, and Susik Yoon. 2026. PEARL: Front-Loading Relational Chains for Multi-Hop Table Retrieval. In Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing, pages 57952–57976, Budapest, Hungary. Association for Computational Linguistics.
Cite (Informal):
PEARL: Front-Loading Relational Chains for Multi-Hop Table Retrieval (Ho et al., EMNLP 2026)
Copy Citation:
PDF:
https://aclanthology.org/2026.emnlp-main.2549.pdf