Skip to content

TabJoinBench: A Benchmark for Joinable Table Discovery

Sep 2026 · 0 citations · 26 references
Computer Science

TL;DR

This work evaluates representative join discovery methods spanning set-based, feature-based, and learned approaches, together with general-purpose language-model embedding baselines, and publicly release the processed datasets, ground-truth annotations, and generation pipeline to facilitate reproducible evaluation and future research.

Abstract

Join discovery aims to identify tables from large data repositories that can augment a query table with complementary information, enabling downstream tasks such as data exploration, feature engineering, and business intelligence. Although numerous join discovery methods have been proposed, existing studies rely on method-specific benchmark construction, making reproducible and fair comparison difficult. We present TabJoinBench, a benchmark for evaluating join discovery methods across semantic, relational, and hybrid data lake scenarios. TabJoinBench constructs query-candidate pairs using source-specific validation strategies, systematically introduces structural, representation, and semantic changes through composable perturbations while preserving reliable ground truth. We evaluate representative join discovery methods spanning set-based, feature-based, and learned approaches, together with general-purpose language-model embedding baselines, and publicly release the processed datasets, ground-truth annotations, and generation pipeline to facilitate reproducible evaluation and future research.

View source

Similar papers

Book Open access Nov 2026

TabgenQA: A Platform for Non-Relational, Multi-Tabular, Numerical QA Benchmark Generation and LLM Evaluation

Large language models (LLMs) are widely used for tabular data analysis, but their performance often does not transfer from standard Table QA benchmarks to real-world settings, where tables are typically non-relational, with hierarchical headers, merged cells, inconsistent units, noise, and implicit cross-table dependen...

Michele Luca Contalbo, Matteo Paganelli, Paolo Papotti et al. · 0 citations
Book Open access Nov 2026

Benchmarking Agentic Text-to-SPARQL for Multi-Hop Scholarly Knowledge Graph Exploration

Conversational access to scholarly knowledge graphs promises more intuitive ways of exploring research fields, but current approaches remain limited by two major barriers: the lack of realistic multi-hop benchmarks and the brittleness of Text-to-SPARQL methods over real-world schemas. We address these gaps by introduci...

Tim Gollub, Furqan Shuja, Benno Stein · 0 citations
Open access 2026

Improving data discovery effectiveness: experimental evaluation of content-based catalogs in data spaces

Data spaces facilitate sovereignty-preserving data sharing within federated ecosystems; however, dataset discovery is often constrained by catalogs that rely primarily on high-level metadata standards such as DCAT-AP. These models typically lack structural and content-level details, which impedes fine-grained relevance...

Adriana Morejón, Alberto Berenguer, Lucia de Espona et al. · 0 citations
Conference Open access Oct 2026

DBRAG: Multi-Table Retrieval-Augmented Generation for Complex Database Queries

Recent advancements in large language models have introduced new capabilities for reasoning over structured data, particularly through program-aided tools that can analyze tables. However, many existing methods address single-table scenarios or assume that the relevant tables are already provided. In practice, users of...

Prince Larbi Ampofo, Ryoji Kubo, D. Difallah · 0 citations
Open access Sep 2026

Supervised and LLM-Augmented Cardinality Estimation for Similarity Queries on Knowledge Graphs

Over the past decades, query cardinality estimation on relational databases has been proven crucial, enabling the result size estimation of all sub-plans of each query. This allowed query optimizers to design efficient query plans, towards minimizing the query response time. Lately, knowledge graphs are being preferr...

Georgios Chatzigeorgakidis, Dimitrios Skoutas, A. Simitsis · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.