Abstract

Schema matching, which can find semantic correspondences between elements of two schemas, plays a key role in many applications, such as data warehouse, heterogeneous data sources integration and semantic web. Currently, most schema matching problems are achieved by the similar column names in the schemas to be matched, or common domains in the data stored in the schemas. However, reasonable results can not be obtained by these methods when column names and data values are difficult to explain or "opaque" in schemas. In this paper, a new schema matching algorithm which can discover semantic matches between opaque database schemas is proposed. Compared with the original schema matching algorithm, the computation is reduced greatly, the core calculation process and matching process of algorithm are simplified, and the efficiency and precision is enhanced.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.