Calibration and comparison of schema matchers

  • Authors:

  • Peter Martinek;Balazs Villanyi;Bela Szikora

  • Affiliations:

  • Department of Electronics Technology, Budapest University of Technology and Economics, Budapest, Hungary;Department of Electronics Technology, Budapest University of Technology and Economics, Budapest, Hungary;Department of Electronics Technology, Budapest University of Technology and Economics, Budapest, Hungary

  • Venue:
  • WSEAS Transactions on Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Schemas used in various environments become more and more numerous, though they do not comply to a universal standard. That is why the task of schema matching has emerged and its main objective is to find means to map a schema into another. Several initiations have occurred and algorithms have been proposed to solve the problem. They muster highly enticing solutions, though they have several flaws. We have reviewed the available algorithms and implemented some of them. We found that the accuracy of these solutions is strongly dependent on some well definable matcher characteristics, so if we calibrate the matchers they perform a lot better. Taking into account this fact we cannot compare matchers until after the necessary calibration. We propose matcher independent procedures and mathematical formulas to perform the highly desirable pre-run configuration of candidate solutions. The necessity of calibration implies that the unbiased comparison of solutions is not possible until the configuration is performed. We also introduce the technique of multiple thresholding which promises a better view of the result list returned by the individual matchers.