The University of Southampton
University of Southampton Institutional Repository

DYMS (dynamic matcher selector)-scenario-based schema matcher selector

DYMS (dynamic matcher selector)-scenario-based schema matcher selector
DYMS (dynamic matcher selector)-scenario-based schema matcher selector
Schema matching is one of the main challenges in different information system integration contexts. Over the past 20 years, different schema matching methods have been proposed and shown to be successful in various situations. Although numerous advanced matching algorithms have emerged, schema matching research remains a critical issue. Different algorithms are implemented to resolve different types of schema heterogeneities, including differences in design methodologies, naming conventions, and the level of specificity of schemas, amongst others. The algorithms are usually too generic regardless of the schema matching scenario. This situation indicates that a single matcher cannot be optimized for all matching scenarios. In this research, I proposed a dynamic matcher selector (DYMS) as a probable solution to the aforementioned problem. The proposed DYMS analyzes the schema matching scenario and selects the most appropriate matchers for a given scenario. Selecting matchers are weighted based on the parameter optimization process, which adopts the heuristic learning approach. The DYMS returns the alignment result of input schemas.
Matcher selection, Schema integration, Schema matching, Schema matching strategy
Choi, Youngseok
928c489e-7c5b-42fc-bad8-77ce717ba106
Choi, Youngseok
928c489e-7c5b-42fc-bad8-77ce717ba106

Choi, Youngseok (2013) DYMS (dynamic matcher selector)-scenario-based schema matcher selector. In Proceedings - Pacific Asia Conference on Information Systems, PACIS 2013.

Record type: Conference or Workshop Item (Paper)

Abstract

Schema matching is one of the main challenges in different information system integration contexts. Over the past 20 years, different schema matching methods have been proposed and shown to be successful in various situations. Although numerous advanced matching algorithms have emerged, schema matching research remains a critical issue. Different algorithms are implemented to resolve different types of schema heterogeneities, including differences in design methodologies, naming conventions, and the level of specificity of schemas, amongst others. The algorithms are usually too generic regardless of the schema matching scenario. This situation indicates that a single matcher cannot be optimized for all matching scenarios. In this research, I proposed a dynamic matcher selector (DYMS) as a probable solution to the aforementioned problem. The proposed DYMS analyzes the schema matching scenario and selects the most appropriate matchers for a given scenario. Selecting matchers are weighted based on the parameter optimization process, which adopts the heuristic learning approach. The DYMS returns the alignment result of input schemas.

Full text not available from this repository.

More information

Published date: 2013
Keywords: Matcher selection, Schema integration, Schema matching, Schema matching strategy

Identifiers

Local EPrints ID: 437736
URI: http://eprints.soton.ac.uk/id/eprint/437736
PURE UUID: 0349fd2c-94da-4b24-b0cb-d49a8a21bee4
ORCID for Youngseok Choi: ORCID iD orcid.org/0000-0001-9842-5231

Catalogue record

Date deposited: 13 Feb 2020 17:31
Last modified: 14 Feb 2020 01:48

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×