|
|
|
     |
                                     |
Return to Meta-Data Management
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding pairwise-attribute correspondence. This paper proposes a different approach, motivated by integrating large numbers of data sources on the Internet. On this "deep Web," we observe two distinguishing characteristics that offer a new view for considering schema matching: First, as the Web scales, there are ample sources that provide structured information in the same domains (e.g., books and automobiles). Second, while sources proliferate, their aggregate schema vocabulary tends to converge at a relatively small size. Motivated by these observations, we propose a new paradigm, statistical schema matching: Unlike traditional approaches using pairwise-attribute correspondence, we take a holistic approach to match all input schemas by finding an underlying generative schema model. We propose a general statistical framework MGS for such hidden model discovery, which consists of hypothesis modeling, generation, and selection. Further, we specialize the general framework to develop Algorithm MGSsd, targeting at synonym discovery, a canonical problem of schema matching, by designing and discovering a model that speci cally captures synonym attributes. We demonstrate our approach over hundreds of real Web sources in four domains and the results show good accuracy.
@inproceedings {DBLP:conf/sigmod/HeC03, author = {Bin He and Kevin Chen-Chuan Chang}, booktitle = {SIGMOD Conference}, title = {Statistical Schema Matching across Web Query Interfaces.}, pages = {217-228}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#HeC03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r08p03.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
