Scalable Data Discovery Using Profiles
Javier Flores, Sergi Nadal, Oscar Romero

TL;DR
This paper introduces NextiaJD, a scalable, profile-based system for discovering joinable datasets at scale, achieving high accuracy and efficiency while reducing false positives compared to existing hash-based methods.
Contribution
It proposes a novel profile-based approach with a new join quality metric, enabling scalable and accurate dataset joinability prediction at large volumes.
Findings
NextiaJD matches hash-based methods in predictive performance.
It scales to larger data volumes efficiently.
It significantly reduces false positives at scale.
Abstract
We study the problem of discovering joinable datasets at scale. This is, how to automatically discover pairs of attributes in a massive collection of independent, heterogeneous datasets that can be joined. Exact (e.g., based on distinct values) and hash-based (e.g., based on locality-sensitive hashing) techniques require indexing the entire dataset, which is unattainable at scale. To overcome this issue, we approach the problem from a learning perspective relying on profiles. These are succinct representations that capture the underlying characteristics of the schemata and data values of datasets, which can be efficiently extracted in a distributed and parallel fashion. Profiles are then compared, to predict the quality of a join operation among a pair of attributes from different datasets. In contrast to the state-of-the-art, we define a novel notion of join quality that relies on a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsText and Document Classification Technologies · Advanced Image and Video Retrieval Techniques · Spam and Phishing Detection
