Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Erik M. Ferragut (5 papers)
  2. Jason Laska (3 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.