0 citations0 references

Finding related tables

2012pp. 817–828

Citations Over TimeTop 1% of 2012 papers

Anish Das Sarma, Lujun Fang, Nitin Gupta, Alon Halevy, Hongrae Lee, Fei Wu, Reynold Xin, Cong Yu

Abstract

We consider the problem of finding related tables in a large corpus of heterogenous tables. Detecting related tables provides users a powerful tool for enhancing their tables with additional data and enables effective reuse of available public data. Our first contribution is a framework that captures several types of relatedness, including tables that are candidates for joins and tables that are candidates for union. Our second contribution is a set of algorithms for detecting related tables that can be either unioned or joined. We describe a set of experiments that demonstrate that our algorithms produce highly related tables. We also show that we can often improve the results of table search by pulling up tables that are ranked much lower based on their relatedness to top-ranked tables. Finally, we describe how to scale up our algorithms and show the results of running it on a corpus of over a million tables extracted from Wikipedia.

Related Papers

→ Application of Filters to Multiway Joins in MapReduce(2014)6 cited
→ A comparative evaluation of techniques for N-way joins in wireless sensors networks(2020)3 cited
→ Faster joins, self-joins and multi-way joins using join indices(1998)15 cited
The Network Joins Each Other and Joins Installation to Use Dwelling(2007)
USING SEMI-JOINS TO REALIZE JOINS AND MIXED-SEMI(?)JOINS(1987)