2004Unpublished venueRequires access

An Approach to Database Schema Matching Based on Entity Classification

Shi Tang

Open publisher page 2 citations

Abstract

Schema matching plays a key role in many application domains,such as data integration,data warehouse, and information share and exchange on computer network. Currently,approaches of automatic schema matching cannot solve matching issue under the circumstance of complex schema well. This paper introduces an approach based on entity classification in the domain of relation schema. It divides entities into different categories (sub-schema) using Na ive Bayes Learning ,and then matches schema elements between the sub-schemas with the same category. It can effectively improve matching results, reduce the number of element-to-element comparisons and save user efforts under the circumstance of complex schema.

About this research paper

What this paper is about

Schema matching plays a key role in many application domains,such as data integration,data warehouse, and information share and exchange on computer network. Currently,approaches of automatic schema matching cannot solve matching issue under the circumstance of complex schema well. This paper introduces an approach based on entity classification in the domain of relation schema. It divides entities into different categories (sub-schema) using Na ive Bayes Learning ,and then matches schema elements between the sub-schemas with the same category. It can effectively improve matching results, reduce the number of element-to-element comparisons and save user efforts under the circumstance of complex schema.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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 plays a key role in many application domains,such as data integration,data warehouse, and information share and exchange on computer network. Currently,approaches of automatic schema matching cannot solve matching issue under the circumstance of complex schema well. This paper introduces an approach based on entity classification in the domain of relation schema. It divides entities into different categories (sub-schema) using Na ive Bayes Learning ,and then matches schema elements between the sub-schemas with the same category. It can effectively improve matching results, reduce the number of element-to-element comparisons and save user efforts under the circumstance of complex schema.

Key concepts: Schema matching, Computer science, Star schema, Schema (genetic algorithms), Semi-structured model, Database schema, Information schema, Conceptual schema

Related papers

Back to paper searchBrowse research topicsOriginal source
An Approach to Database Schema Matching Based on Entity Classification — Research Paper | ScholarLens