QJoin: Transformation-aware Joinable Data Discovery Using Reinforcement Learning

• URL: http://arxiv.org/abs/2512.02444v1
• Date: Tue, 02 Dec 2025 06:05:48 GMT
• Title: QJoin: Transformation-aware Joinable Data Discovery Using Reinforcement Learning
• Abstract summary: We introduce QJoin, a reinforcement-learning framework that learns and reuses transformation strategies across join tasks.<n>For 19,990 join tasks in NYC+Chicago open, Qjoin reduces runtime by up to 7.4% (13,747 datasets s) by using reusing.
• Score: 11.61186748860627
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Discovering which tables in large, heterogeneous repositories can be joined and by what transformations is a central challenge in data integration and data discovery. Traditional join discovery methods are largely designed for equi-joins, which assume that join keys match exactly or nearly so. These techniques, while efficient in clean, well-normalized databases, fail in open or federated settings where identifiers are inconsistently formatted, embedded, or split across multiple columns. Approximate or fuzzy joins alleviate minor string variations but cannot capture systematic transformations. We introduce QJoin, a reinforcement-learning framework that learns and reuses transformation strategies across join tasks. QJoin trains an agent under a uniqueness-aware reward that balances similarity with key distinctiveness, enabling it to explore concise, high-value transformation chains. To accelerate new joins, we introduce two reuse mechanisms: (i) agent transfer, which initializes new policies from pretrained agents, and (ii) transformation reuse, which caches successful operator sequences for similar column clusters. On the AutoJoin Web benchmark (31 table pairs), QJoin achieves an average F1-score of 91.0%. For 19,990 join tasks in NYC+Chicago open datasets, Qjoin reduces runtime by up to 7.4% (13,747 s) by using reusing. These results demonstrate that transformation learning and reuse can make join discovery both more accurate and more efficient.

Related papers

• MosaicJoin: Compact Semantic Sketches for Value-Level Join Discovery [8.85894971478123]
  Join discovery is a core task in dataset search, enabling users to find columns that can be joined with a given query column.<n>Recent approaches discover semantically joinable columns but face a fundamental trade-off.<n>We present MosaicJoin, a value-level semantic join discovery method that balances this trade-off.
  arXiv  Detail & Related papers  (2026-07-23T19:55:19Z)
• SemJoin: Semantic Join Optimization [5.770286315818393]
  A semantic join can be evaluated with a large language model (LLM), but comparing every pair of predicates requires O(M x N) invocations and is cost-prohibitive at scale.<n>We propose an LLM-agent-based decision pipeline that optimize semantic joins by matching the execution strategy of the underlying tables.
  arXiv  Detail & Related papers  (2026-06-28T17:57:10Z)
• SQL-ASTRA: Alleviating Sparse Feedback in Agentic SQL via Column-Set Matching and Trajectory Aggregation [51.696027315573296]
  We propose a framework featuring a universal two-tiered reward mechanism designed to provide effective trajectory-level evaluation and dense step-level signals.<n>In traditional paradigms, rewards are determined solely by the final-turn feedback, which ignores the intermediate process and leads to ambiguous credit evaluation.<n>We show that our approach outperforms SOTA Arctic-Text2-R1-7B on BIRD 2.0 using identical models, propelling Text-to-reward convergence toward a robust multi-turn agent paradigm.
  arXiv  Detail & Related papers  (2026-03-17T06:26:36Z)
• 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)
• TeaRAG: A Token-Efficient Agentic Retrieval-Augmented Generation Framework [62.66056331998838]
  TeaRAG is a token-efficient agentic RAG framework capable of compressing both retrieval content and reasoning steps.<n>Our reward function evaluates the knowledge sufficiency by a knowledge matching mechanism, while penalizing excessive reasoning steps.
  arXiv  Detail & Related papers  (2025-11-07T16:08:34Z)
• QDER: Query-Specific Document and Entity Representations for Multi-Vector Document Re-Ranking [5.469844680867749]
  We introduce QDER, a neural re-ranking model that unifies approaches by integrating knowledge graph semantics into a multi-vector model.<n>QDER's key innovation lies in its modeling of query-document relationships.<n>We first transform these fine-grained representations through learned attention patterns, then apply carefully chosen mathematical operations for precise matches.
  arXiv  Detail & Related papers  (2025-10-13T16:31:06Z)
• TableZoomer: A Collaborative Agent Framework for Large-scale Table Question Answering [26.00027389659854]
  TableZoomer is a programming-based agent framework for the table question answering (TQA) task.<n>It introduces three key innovations: (1) replacing the original fully verbalized table with structured table schema to bridge the semantic gap and reduce computational complexity; (2) a query-aware table zooming mechanism that dynamically generates sub-table schema through column selection and entity linking; and (3) a Program-of-Thoughts (PoT) strategy that transforms queries into executable code to mitigate numerical hallucination.
  arXiv  Detail & Related papers  (2025-09-01T09:53:01Z)
• Representation Quantization for Collaborative Filtering Augmentation [49.14087936092634]
  We propose a novel two-stage collaborative recommendation algorithm, DQRec.<n>It augments features and homogeneous linkages by extracting behavior characteristics jointly from interaction sequences and attributes.<n>By integrating these semantic ID patterns into the recommendation process through feature and linkage augmentation, the system enriches both latent and explicit user and item features.
  arXiv  Detail & Related papers  (2025-08-15T04:00:50Z)
• A Query-Aware Multi-Path Knowledge Graph Fusion Approach for Enhancing Retrieval-Augmented Generation in Large Language Models [3.0748861313823]
  QMKGF is a Query-Aware Multi-Path Knowledge Graph Fusion Approach for Enhancing Retrieval Augmented Generation.<n>We design prompt templates and employ general-purpose LLMs to extract entities and relations.<n>We introduce a multi-path subgraph construction strategy that incorporates one-hop relations, multi-hop relations, and importance-based relations.
  arXiv  Detail & Related papers  (2025-07-07T02:22:54Z)
• 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)
• SiReRAG: Indexing Similar and Related Information for Multihop Reasoning [96.60045548116584]
  SiReRAG is a novel RAG indexing approach that explicitly considers both similar and related information.<n>SiReRAG consistently outperforms state-of-the-art indexing methods on three multihop datasets.
  arXiv  Detail & Related papers  (2024-12-09T04:56:43Z)
• Learning Equivariant Segmentation with Instance-Unique Querying [47.52528819153683]
  We devise a new training framework that boosts query-based models through discriminative query embedding learning. Our algorithm uses the queries to retrieve the corresponding instances from the whole training dataset. On top of four famous, query-based models, our training algorithm provides significant performance gains.
  arXiv  Detail & Related papers  (2022-10-03T13:14:00Z)
• Group DETR: Fast DETR Training with Group-Wise One-to-Many Assignment [80.55064790937092]
  One-to-many assignment, assigning one ground-truth object to multiple predictions, succeeds in detection methods such as Faster R-CNN and FCOS. We introduce Group DETR, a simple yet efficient DETR training approach that introduces a group-wise way for one-to-many assignment. Experiments show that Group DETR significantly speeds up the training convergence and improves the performance of various DETR-based models.
  arXiv  Detail & Related papers  (2022-07-26T17:57:58Z)
• Efficient Long Sequence Encoding via Synchronization [29.075962393432857]
  We propose a synchronization mechanism for hierarchical encoding. Our approach first identifies anchor tokens across segments and groups them by their roles in the original input sequence. Our approach is able to improve the global information exchange among segments while maintaining efficiency.
  arXiv  Detail & Related papers  (2022-03-15T04:37:02Z)
• Cluster-Former: Clustering-based Sparse Transformer for Long-Range Dependency Encoding [90.77031668988661]
  Cluster-Former is a novel clustering-based sparse Transformer to perform attention across chunked sequences. The proposed framework is pivoted on two unique types of Transformer layer: Sliding-Window Layer and Cluster-Former Layer. Experiments show that Cluster-Former achieves state-of-the-art performance on several major QA benchmarks.
  arXiv  Detail & Related papers  (2020-09-13T22:09:30Z)

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.