Correlation Sketches for Approximate Join-Correlation Queries
arXiv:2104.03353 · doi:10.1145/3448016.3458456
Abstract
The increasing availability of structured datasets, from Web tables and open-data portals to enterprise data, opens up opportunities~to enrich analytics and improve machine learning models through relational data augmentation. In this paper, we introduce a new class of data augmentation queries: join-correlation queries. Given a column and a join column from a query table , retrieve tables in a dataset collection such that is joinable with on and there is a column such that is correlated with . A naïve approach to evaluate these queries, which first finds joinable tables and then explicitly joins and computes correlations between and all columns of the discovered tables, is prohibitively expensive. To efficiently support correlated column discovery, we 1) propose a sketching method that enables the construction of an index for a large number of tables and that provides accurate estimates for join-correlation queries, and 2) explore different scoring strategies that effectively rank the query results based on how well the columns are correlated with the query. We carry out a detailed experimental evaluation, using both synthetic and real data, which shows that our sketches attain high accuracy and the scoring strategies lead to high-quality rankings.
Proceedings of the 2021 International Conference on Management of Data (SIGMOD '21)
References in corpus (6)
- Measuring and testing dependence by correlation of distances
- Comparing the Pearson and Spearman Correlation Coefficients Across Distributions and Sample Sizes: A Tutorial Using Simulations and Empirical Data
- Deep Unsupervised Cardinality Estimation
- Web Table Extraction, Retrieval and Augmentation: A Survey
- Practical Hash Functions for Similarity Estimation and Dimensionality Reduction
- Joins on Samples: A Theoretical Guide for Practitioners