MosaicJoin: Compact Semantic Sketches for Value-Level Join Discovery

• URL: http://arxiv.org/abs/2607.21781v1
• Date: Thu, 23 Jul 2026 19:55:19 GMT
• Title: MosaicJoin: Compact Semantic Sketches for Value-Level Join Discovery
• Abstract summary: 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.
• Score: 8.85894971478123
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Join discovery is a core task in dataset search, enabling users to find columns that can be joined with a given query column. Early approaches focused on equi-joins, but data lakes and open-data repositories often contain columns whose values refer to the same entity but use different syntactic representations. To address this challenge, recent approaches discover semantically joinable columns but face a fundamental trade-off: methods that perform value-level comparisons accurately identify joinable columns but scale poorly to columns with high cardinality; column-level methods that encode an entire column into a single embedding are efficient but do not capture the fine-grained value alignment that determines whether a join is possible. We present MosaicJoin, a value-level semantic join discovery method that balances this trade-off. MosaicJoin achieves scalability through a novel sketching strategy that approximates the joinability of a column pair without having to compare all values. At query time, MosaicJoin scores each candidate sketch using a joinability score at a cost bounded by the sketch size, making retrieval efficient even for high-cardinality columns. A query subsampling operator further reduces online search time with provable accuracy guarantees, enabling robust retrieval for large query columns. Extensive experiments show that MosaicJoin outperforms previously published methods across all benchmarks while running up to 66 times faster than other value-level methods. MosaicJoin requires no training or fine-tuning, and it scales robustly to query columns containing up to 57K values and data lake columns containing up to 1M values.

Related papers

• Hyperdimensional computing for structured querying on tabular data embeddings [2.260258863997296]
  Tabular data embeddings have become a cornerstone of data profiling and data integration pipelines.<n>Existing approaches embed rows, columns, or entire tables into a vector space and rely on nearest-neighbor search to retrieve candidate matches.<n>A fundamental limitation of current embedding methods is the lack of interpretable similarity scores.
  arXiv  Detail & Related papers  (2026-06-11T19:54:11Z)
• 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)
• HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery [27.204701078044252]
  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.
  arXiv  Detail & Related papers  (2026-01-03T00:54:55Z)
• QJoin: Transformation-aware Joinable Data Discovery Using Reinforcement Learning [11.61186748860627]
  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.
  arXiv  Detail & Related papers  (2025-12-02T06:05:48Z)
• Tailoring Table Retrieval from a Field-aware Hybrid Matching Perspective [70.13748256886288]
  Table retrieval is less explored compared to text retrieval.<n>Different table fields have varying matching preferences.<n>We introduce a Table-tailored HYbrid Matching rEtriever (THYME)
  arXiv  Detail & Related papers  (2025-03-04T03:57:10Z)
• 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)
• CART: A Generative Cross-Modal Retrieval Framework with Coarse-To-Fine Semantic Modeling [53.97609687516371]
  Cross-modal retrieval aims to search for instances, which are semantically related to the query through the interaction of different modal data.<n>Traditional solutions utilize a single-tower or dual-tower framework to explicitly compute the score between queries and candidates.<n>We propose a generative cross-modal retrieval framework (CART) based on coarse-to-fine semantic modeling.
  arXiv  Detail & Related papers  (2024-06-25T12:47:04Z)
• Database-Augmented Query Representation for Information Retrieval [71.41745087624528]
  We present a novel retrieval framework called Database-Augmented Query representation (DAQu)<n>DAQu augments the original query with various (query-related) metadata across multiple tables.<n>We validate our DAQu in diverse retrieval scenarios, demonstrating that it significantly enhances overall retrieval performance.
  arXiv  Detail & Related papers  (2024-06-23T05:02:21Z)
• 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)
• 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)

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.