An integrated clustering method for holistic schema matching

Adel A. Alofairi, Kamsuriah Ahmad

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Schema matching is an interesting research topic which had been paid considerable attention by many researchers in the database community. It aims at identifying semantic correspondences between two schemas. Holistic schema matching was proposed to match many schemas at the same time. As an active research topic in the field of schema integration, holistic schema matching tackles the challenge of matching large scale schema. Matching the complete input schemas may not only lead into taking a long execution time, but also poor quality matching results. Therefore, achieving good performance for the schema matching in a large search space is difficult and challenging process. Recently, a number of methods were proposed to solve this schema matching using popular clustering techniques namely k-means or agglomerative hierarchical clustering techniques. These techniques are usually used to reduce the search space, albeit with some drawbacks. However, the existing methods still can to be improved. In order to improve the matching efficiency and clustering process, this paper aims at finding an effective method for holistic schema matching in terms of reducing the searching space. The combination of clustering techniques was proposed. To achieve the main objective, the methodology includes two phases: preprocessing and clustering. The findings of the study revealed that the matching method proposed in this study reduced the searching space by using an integrated clustering technique that rapidly groups the most correspondences attributes in the same clusters. The results of the study prove that this method is effective and promising in holistic schema matching.

Original languageEnglish
Pages (from-to)294-301
Number of pages8
JournalJournal of Theoretical and Applied Information Technology
Volume68
Issue number2
Publication statusPublished - 1 Oct 2014

Fingerprint

Schema Matching
Clustering Methods
Schema
Clustering
Semantics
Search Space
Correspondence
Hierarchical Clustering
K-means
Execution Time
Preprocessing
Attribute
Methodology

Keywords

  • Clustering
  • Holistic Schema Matching
  • Search Space Reduction

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

An integrated clustering method for holistic schema matching. / Alofairi, Adel A.; Ahmad, Kamsuriah.

In: Journal of Theoretical and Applied Information Technology, Vol. 68, No. 2, 01.10.2014, p. 294-301.

Research output: Contribution to journalArticle

@article{e9d4a4eab619450981edf85ecac6bc3f,
title = "An integrated clustering method for holistic schema matching",
abstract = "Schema matching is an interesting research topic which had been paid considerable attention by many researchers in the database community. It aims at identifying semantic correspondences between two schemas. Holistic schema matching was proposed to match many schemas at the same time. As an active research topic in the field of schema integration, holistic schema matching tackles the challenge of matching large scale schema. Matching the complete input schemas may not only lead into taking a long execution time, but also poor quality matching results. Therefore, achieving good performance for the schema matching in a large search space is difficult and challenging process. Recently, a number of methods were proposed to solve this schema matching using popular clustering techniques namely k-means or agglomerative hierarchical clustering techniques. These techniques are usually used to reduce the search space, albeit with some drawbacks. However, the existing methods still can to be improved. In order to improve the matching efficiency and clustering process, this paper aims at finding an effective method for holistic schema matching in terms of reducing the searching space. The combination of clustering techniques was proposed. To achieve the main objective, the methodology includes two phases: preprocessing and clustering. The findings of the study revealed that the matching method proposed in this study reduced the searching space by using an integrated clustering technique that rapidly groups the most correspondences attributes in the same clusters. The results of the study prove that this method is effective and promising in holistic schema matching.",
keywords = "Clustering, Holistic Schema Matching, Search Space Reduction",
author = "Alofairi, {Adel A.} and Kamsuriah Ahmad",
year = "2014",
month = "10",
day = "1",
language = "English",
volume = "68",
pages = "294--301",
journal = "Journal of Theoretical and Applied Information Technology",
issn = "1992-8645",
publisher = "Asian Research Publishing Network (ARPN)",
number = "2",

}

TY - JOUR

T1 - An integrated clustering method for holistic schema matching

AU - Alofairi, Adel A.

AU - Ahmad, Kamsuriah

PY - 2014/10/1

Y1 - 2014/10/1

N2 - Schema matching is an interesting research topic which had been paid considerable attention by many researchers in the database community. It aims at identifying semantic correspondences between two schemas. Holistic schema matching was proposed to match many schemas at the same time. As an active research topic in the field of schema integration, holistic schema matching tackles the challenge of matching large scale schema. Matching the complete input schemas may not only lead into taking a long execution time, but also poor quality matching results. Therefore, achieving good performance for the schema matching in a large search space is difficult and challenging process. Recently, a number of methods were proposed to solve this schema matching using popular clustering techniques namely k-means or agglomerative hierarchical clustering techniques. These techniques are usually used to reduce the search space, albeit with some drawbacks. However, the existing methods still can to be improved. In order to improve the matching efficiency and clustering process, this paper aims at finding an effective method for holistic schema matching in terms of reducing the searching space. The combination of clustering techniques was proposed. To achieve the main objective, the methodology includes two phases: preprocessing and clustering. The findings of the study revealed that the matching method proposed in this study reduced the searching space by using an integrated clustering technique that rapidly groups the most correspondences attributes in the same clusters. The results of the study prove that this method is effective and promising in holistic schema matching.

AB - Schema matching is an interesting research topic which had been paid considerable attention by many researchers in the database community. It aims at identifying semantic correspondences between two schemas. Holistic schema matching was proposed to match many schemas at the same time. As an active research topic in the field of schema integration, holistic schema matching tackles the challenge of matching large scale schema. Matching the complete input schemas may not only lead into taking a long execution time, but also poor quality matching results. Therefore, achieving good performance for the schema matching in a large search space is difficult and challenging process. Recently, a number of methods were proposed to solve this schema matching using popular clustering techniques namely k-means or agglomerative hierarchical clustering techniques. These techniques are usually used to reduce the search space, albeit with some drawbacks. However, the existing methods still can to be improved. In order to improve the matching efficiency and clustering process, this paper aims at finding an effective method for holistic schema matching in terms of reducing the searching space. The combination of clustering techniques was proposed. To achieve the main objective, the methodology includes two phases: preprocessing and clustering. The findings of the study revealed that the matching method proposed in this study reduced the searching space by using an integrated clustering technique that rapidly groups the most correspondences attributes in the same clusters. The results of the study prove that this method is effective and promising in holistic schema matching.

KW - Clustering

KW - Holistic Schema Matching

KW - Search Space Reduction

UR - http://www.scopus.com/inward/record.url?scp=84908142952&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908142952&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84908142952

VL - 68

SP - 294

EP - 301

JO - Journal of Theoretical and Applied Information Technology

JF - Journal of Theoretical and Applied Information Technology

SN - 1992-8645

IS - 2

ER -