HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery

• URL: http://arxiv.org/abs/2601.01015v1
• Date: Sat, 03 Jan 2026 00:54:55 GMT
• Title: HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery
• Abstract summary: We propose a large language model (LLM)-augmented Hypergraph framework for joinable table discovery.<n>Specifically, we first construct a hypergraph to model tables using both the intra-table hyperedges and the LLM-augmented inter-table hyperedges.<n>We then design HIN, a Hierarchical Interaction Network that learns expressive column representations through bidirectional message passing over columns and hyperedges.
• Score: 27.204701078044252
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As a pivotal task in data lake management, joinable table discovery has attracted widespread interest. While existing language model-based methods achieve remarkable performance by combining offline column representation learning with online ranking, their design insufficiently accounts for the underlying structural interactions: (1) offline, they directly model tables into isolated or pairwise columns, thereby struggling to capture the rich inter-table and intra-table structural information; and (2) online, they rank candidate columns based solely on query-candidate similarity, ignoring the mutual interactions among the candidates, leading to incoherent result sets. To address these limitations, we propose HyperJoin, a large language model (LLM)-augmented Hypergraph framework for Joinable table discovery. Specifically, we first construct a hypergraph to model tables using both the intra-table hyperedges and the LLM-augmented inter-table hyperedges. Consequently, the task of joinable table discovery is formulated as link prediction on this constructed hypergraph. We then design HIN, a Hierarchical Interaction Network that learns expressive column representations through bidirectional message passing over columns and hyperedges. To strengthen coherence and internal consistency in the result columns, we cast online ranking as a coherence-aware top-k column selection problem. We then introduce a reranking module that leverages a maximum spanning tree algorithm to prune noisy connections and maximize coherence. Experiments demonstrate the superiority of HyperJoin, achieving average improvements of 21.4% (Precision@15) and 17.2% (Recall@15) over the best baseline.

Related papers

• H2Table: Hierarchical Hypergraph-Enhanced Large Language Models for Complex Table Reasoning [16.150378428877445]
  H2Table is a novel framework that represents complex tables as hierarchical nested hypergraphs.<n>We design a tailored hypergraph encoder to facilitate message passing between hyperedges (headers) and nodes (cells)
  arXiv  Detail & Related papers  (2026-09-01T13:19:42Z)
• RACT: Retrieval Augmented Column-Table Learning and Prediction for Multi-Table Schema Matching [0.13999481573773068]
  RACT learning and prediction is used to exploit referential context for holistic schema matching.<n> constraining the column search space via top-t tables improves both average matching precision and completeness by up to +70%.
  arXiv  Detail & Related papers  (2026-06-05T21:08:40Z)
• Hypergraph as Language [49.35033483821496]
  We propose a hypergraph-native alignment framework for large language models.<n>For hypergraph structures, existing methods often fail to preserve the native semantics that multiple objects are jointly connected by the same high-order relation.<n>We show that Hyper-Align significantly outperforms existing methods across in-domain and zero-shot evaluations.
  arXiv  Detail & Related papers  (2026-05-21T01:09:48Z)
• CORE-T: COherent REtrieval of Tables for Text-to-SQL [91.76918495375384]
  CORE-T is a scalable, training-free framework that enriches tables with purpose metadata and pre-computes a lightweight table-compatibility cache.<n>Across Bird, Spider, and MMQA, CORE-T improves table-selection F1 by up to 22.7 points while retrieving up to 42% fewer tables.
  arXiv  Detail & Related papers  (2026-01-19T14:51:23Z)
• Plugging Schema Graph into Multi-Table QA: A Human-Guided Framework for Reducing LLM Reliance [8.83042313837811]
  We propose a graph-based framework that leverages human-curated relational knowledge to explicitly encode schema links and join paths.<n>Given a natural language query, our method searches on graph to construct interpretable reasoning chains, aided by pruning and sub-path merging strategies.<n>Experiments on both standard benchmarks and a realistic, large-scale dataset demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2025-06-04T20:21:52Z)
• RAG over Tables: Hierarchical Memory Index, Multi-Stage Retrieval, and Benchmarking [63.253294691180635]
  In real-world scenarios, beyond pure text, a substantial amount of knowledge is stored in tables.<n>We first propose a table-corpora-aware RAG framework, named T-RAG, which consists of the hierarchical memory index, multi-stage retrieval, and graph-aware prompting.
  arXiv  Detail & Related papers  (2025-04-02T04:24:41Z)
• Snoopy: Effective and Efficient Semantic Join Discovery via Proxy Columns [26.053055662905283]
  This paper presents a novel column-level semantic join discovery framework, Snoopy, to bridge effectiveness and efficiency.<n>Experiments on four real-world datasets demonstrate that Snoopy outperforms SOTA column-level methods by 16% in Recall@25 and 10% in NDCG@25.
  arXiv  Detail & Related papers  (2025-02-24T03:48:00Z)
• Joint Entity and Relation Extraction with Span Pruning and Hypergraph Neural Networks [58.43972540643903]
  We propose HyperGraph neural network for ERE ($hgnn$), which is built upon the PL-marker (a state-of-the-art marker-based pipleline model) To alleviate error propagation,we use a high-recall pruner mechanism to transfer the burden of entity identification and labeling from the NER module to the joint module of our model. Experiments on three widely used benchmarks for ERE task show significant improvements over the previous state-of-the-art PL-marker.
  arXiv  Detail & Related papers  (2023-10-26T08:36:39Z)
• HYTREL: Hypergraph-enhanced Tabular Data Representation Learning [36.731257438472035]
  HYTREL is a language model that captures the row/column permutation invariances and three more structural properties of tabular data. We show that HYTREL consistently outperforms other competitive baselines on four downstream tasks with minimal pretraining. Our qualitative analyses showcase that HYTREL can assimilate the table structures to generate robust representations for the cells, rows, columns, and the entire table.
  arXiv  Detail & Related papers  (2023-07-14T05:41:22Z)
• Learnable Pillar-based Re-ranking for Image-Text Retrieval [119.9979224297237]
  Image-text retrieval aims to bridge the modality gap and retrieve cross-modal content based on semantic similarities. Re-ranking, a popular post-processing practice, has revealed the superiority of capturing neighbor relations in single-modality retrieval tasks. We propose a novel learnable pillar-based re-ranking paradigm for image-text retrieval.
  arXiv  Detail & Related papers  (2023-04-25T04:33:27Z)
• DeepJoin: Joinable Table Discovery with Pre-trained Language Models [10.639106014582756]
  Existing approaches target equi-joins, the most common way of combining tables for creating a unified view. Deepjoin is a deep learning model for accurate and efficient joinable table discovery. Deepjoin is even more accurate than an exact solution to semantic joins when evaluated with labels from experts.
  arXiv  Detail & Related papers  (2022-12-15T02:40:57Z)
• A Dataset for Hyper-Relational Extraction and a Cube-Filling Approach [59.89749342550104]
  We propose the task of hyper-relational extraction to extract more specific and complete facts from text. Existing models cannot perform hyper-relational extraction as it requires a model to consider the interaction between three entities. We propose CubeRE, a cube-filling model inspired by table-filling approaches and explicitly considers the interaction between relation triplets and qualifiers.
  arXiv  Detail & Related papers  (2022-11-18T03:51:28Z)
• Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondences [53.09276639185084]
  Multi-view anchor graph clustering selects representative anchors to avoid full pair-wise similarities. Existing approaches do not pay sufficient attention to establishing correct correspondences between the anchor sets across views.
  arXiv  Detail & Related papers  (2022-05-30T13:07:40Z)
• Retrieving Complex Tables with Multi-Granular Graph Representation Learning [20.72341939868327]
  The task of natural language table retrieval seeks to retrieve semantically relevant tables based on natural language queries. Existing learning systems treat tables as plain text based on the assumption that tables are structured as dataframes. We propose Graph-based Table Retrieval (GTR), a generalizable NLTR framework with multi-granular graph representation learning.
  arXiv  Detail & Related papers  (2021-05-04T20:19:03Z)
• TCN: Table Convolutional Network for Web Table Interpretation [52.32515851633981]
  We propose a novel table representation learning approach considering both the intra- and inter-table contextual information. Our method can outperform competitive baselines by +4.8% of F1 for column type prediction and by +4.1% of F1 for column pairwise relation prediction.
  arXiv  Detail & Related papers  (2021-02-17T02:18:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.