2007Unpublished venueRequires access

SMGM:One Schema Matching Model Based on Schema Structures and Known Matching Knowledge

YU En

Open publisher page 0 citations

Abstract

Schema matching is the task of finding semantic correspondences between elements of two schemas.It is critical in many applications,such as data integration,data warehouse loading and XML message mapping,etc.Against the limitations of existed schema matching methods,with the aim of reducing the amount of user effort as much as possible to automatic schema matching,based on the schema structure information and known matching knowledge,we propose a novel approach to schema matching method called SMGM.It imitates the influence procedure between neurons to realize the semantic matching reasoning.By reusing the known matching knowledge to supplement and dive the matching knowledge and curtail the uncertain threshold interval automatically,and presented a self learning schema matching model which can mine and dive the known matching knowledge adaptively and iterately.The result of our experiment shows that the SMGM is feasible.

About this research paper

What this paper is about

Schema matching is the task of finding semantic correspondences between elements of two schemas.It is critical in many applications,such as data integration,data warehouse loading and XML message mapping,etc.Against the limitations of existed schema matching methods,with the aim of reducing the amount of user effort as much as possible to automatic schema matching,based on the schema structure information and known matching knowledge,we propose a novel approach to schema matching method called SMGM.It imitates the influence procedure between neurons to realize the semantic matching reasoning.By reusing the known matching knowledge to supplement and dive the matching knowledge and curtail the uncertain threshold interval automatically,and presented a self learning schema matching model which can mine and dive the known matching knowledge adaptively and iterately.The result of our experiment shows that the SMGM is feasible.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Schema matching is the task of finding semantic correspondences between elements of two schemas.It is critical in many applications,such as data integration,data warehouse loading and XML message mapping,etc.Against the limitations of existed schema matching methods,with the aim of reducing the amount of user effort as much as possible to automatic schema matching,based on the schema structure information and known matching knowledge,we propose a novel approach to schema matching method called SMGM.It imitates the influence procedure between neurons to realize the semantic matching reasoning.By reusing the known matching knowledge to supplement and dive the matching knowledge and curtail the uncertain threshold interval automatically,and presented a self learning schema matching model which can mine and dive the known matching knowledge adaptively and iterately.The result of our experiment shows that the SMGM is feasible.

Key concepts: Schema matching, Computer science, Schema (genetic algorithms), Star schema, Semi-structured model, Matching (statistics), Information retrieval, Document Structure Description

Related papers

Back to paper searchBrowse research topicsOriginal source
SMGM:One Schema Matching Model Based on Schema Structures and Known Matching Knowledge — Research Paper | ScholarLens