SilkMoth: an efficient method for finding related sets with maximum matching constraints

SilkMoth: an efficient method for finding related sets with maximum matching constraints

Determining if two sets are related - that is, if they have similar values or if one set contains the other - is an important problem with many applications in data cleaning, data integration, and information retrieval. For example, set relatedness can be a useful tool to discover whether columns fr...

Full description

Bibliographic Details
Main Authors: Deng, Dong (Author), Kim, Albert (Author), Madden, Samuel R (Author), Stonebraker, Michael (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: VLDB Endowment, 2019-06-18T15:41:13Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items