An Empirical Comparative Study of Instance-based Schema Matching

Abstract

<span lang="EN-US">The main issue concern of schema matching is how to support the merging decision by providing matching between attributes of different schemas. There have been many works in the literature toward utilizing database instances to detect the correspondence between attributes. Most of these previous works aim at improving the match accuracy. We observed that no technique managed to provide an accurate matching for different types of data. In other words, some of the techniques treat numeric values as strings. Similarly, other techniques process textual instance, as numeric, and this negatively influences the process of discovering the match and compromising the matching result. Thus, a practical comparative study between syntactic and semantic techniques is needed. The study emphasizes on analyzing these techniques to determine the strengths and weaknesses of each technique. This paper aims at comparing two different instance-based matching techniques, namely: (i) regular expression and (ii) Google similarity to identify the match between attributes. Several analyses have been conducted on real and synthetic data sets to evaluate the performance of these techniques with respect to Precision (P), Recall (R) and F-Measure.</span>

Determining Strategies on Playing Badminton using the Knuth-Morris-Pratt Algorithm

“…So, it is an algorithm for searching all occurrences of short strings (i.e., patterns) in longer strings of text. There are many approaches and implementations of string matching proposed, such as a practical comparative study between syntactic and semantic techniques was presented in [15], a universal string maching has been introduced in [16], and the algorithm Boyer Moyer was used for dealing with intrusion detection system [17]. Moreover, the string-matching method called Levenshtein distance was used for spelling correction system with the ability to fix real word error and non-word error ends [18].…”