2000 character limit reached
Nonparametric Bayesian Modeling for Automated Database Schema Matching (1507.01443v1)
Published 6 Jul 2015 in cs.IR and cs.DB
Abstract: The problem of merging databases arises in many government and commercial applications. Schema matching, a common first step, identifies equivalent fields between databases. We introduce a schema matching framework that builds nonparametric Bayesian models for each field and compares them by computing the probability that a single model could have generated both fields. Our experiments show that our method is more accurate and faster than the existing instance-based matching algorithms in part because of the use of nonparametric Bayesian models.
- Erik M. Ferragut (5 papers)
- Jason Laska (3 papers)