The Mathematical Model of Hybrid Schema Matching based on Constraints and Instances Similarity

Abstract

Schema matching is a crucial issue in applications that involve multiple databases from heterogeneous sources. Schema matching evolves from a manual process to a semi-automated process to effectively guide users in finding commonalities between schema elements. New models are generally developed using a combination of methods to improve the effectiveness of schema matching results. Our previous research has developed a prototype of hybrid schema matching utilizing a combination of constraints-based method and an instance-based method. The innovation of this paper presents a mathematical formulation of a hybrid schema matching model so it can be run for different cases and becomes the basis of development to improve the effectiveness of output and or efficiency during schema matching process. The developed mathematical model serves to perform the main task in the schema matching process that matches the similarity between attributes, calculates the similarity value of the attribute pair, and specifies the matching attribute pair. Based on the test results, a hybrid schema matching model is more effective than the constraints-based method or instance-based method run individually. The more matching criteria used in the schema matching provide better mapping results. The model developed is limited to schema matching processes in the relational model database.

Authors and Affiliations

Edhy Sutanta, Erna Kumalasari Nurnawati, Rosalia Arum Kumalasanti

Keywords

Related Articles

Data Mining Models Comparison for Diabetes Prediction

From the past few years, data mining got a lot of attention for extracting information from large datasets to find patterns and to establish relationships to solve problems. Well known data mining algorithms include clas...

Algorithms for Content Distribution in Networks

In this paper an algorithm is presented which helps us to optimize the performance of content distribution servers in a network. If it is following the pay-as-you-use model then this algorithm will result in significant...

TPACK Adaptation among Faculty Members of Education and ICT Departments in University of Sindh, Pakistan

Technological Pedagogical Content Knowledge (TPACK) framework has been to investigate the technological and instructive knowledge of teachers. Many researchers have found this framework a useful tool to explore teachers’...

Multi-Criteria Wind Turbine Selection using Weighted Sum Approach

Wind energy is becoming a potential source for renewable and clean energy. An important factor that contributes to efficient generation of wind power is the use of appropriate wind turbine. However, the task of selecting...

 Analyzing Opinions and Argumentation in News Editorials and Op-Eds

 Analyzing opinions and arguments in news editorials and op-eds is an interesting and a challenging task. The challenges lie in multiple levels – the text has to be analyzed in the discourse level (paragraphs and ab...

Download PDF file
  • EP ID EP596841
  • DOI 10.14569/IJACSA.2019.0100659
  • Views 110
  • Downloads 0

How To Cite

Edhy Sutanta, Erna Kumalasari Nurnawati, Rosalia Arum Kumalasanti (2019). The Mathematical Model of Hybrid Schema Matching based on Constraints and Instances Similarity. International Journal of Advanced Computer Science & Applications, 10(6), 459-464. https://europub.co.uk./articles/-A-596841