SCHEMA MATCHING

Abstract:
Introduction:
Schema matching is the technique of identifying objects which are semantically related. In other
words, schema matching is a method of finding the correspondences between the concepts of
different distributed, heterogeneous data sources. Schema matching is considered one of the
basic operations for schema integration and data processing. It has been recognized by a large
range of application as a basic technique for matching different data representations.

Schema matching does not have a unique or universal solution as identification of semantics of
schema objects is an extremely difficult, time-consuming process and is a highly intelligent
process. Schema matching is a highly subjective technique.

There are different schema-matching techniques such as:

 Linguistic matching
 Instance-based matching
 Structure-based matching
 Constraint-based matching
 Hybrid-matching
 Rule-based matching

Currently, schema matching is performed manually, although that has significant limitations. If
performed manually, schema matching is extremely time-consuming and could be infeasible,
especially if there are dynamic environments or large evolving schemas. In many cases, experts
do not fully agree with the final results from schema-matching techniques.

Many applications make use of schema matching. In the case of databases, schema matching is
the first step for generating a view definition and program. Knowledge based applications that
make use of schema matching help in alignment of ontologies. Web applications and health care
use schema matching to align records and reports. Schema matching also helps e-commerce to
align various message formats.
Existing system:
Existing schema matching is based on rules. We have to write set of rules and exceptions for
schema matching. Schema matching starts with trying to identify columns that contain the same
type of information. Most existing schema matchers do this by computing a number of different
distance measures for each possible pair of columns and then applying some rule to aggregate
these into a single score for each column pair. Currently, schema matching is performed
manually, although that has significant limitations. If performed manually, schema matching is
extremely time-consuming and could be infeasible, especially if there are dynamic environments
or large evolving schemas.

In the case of databases, schema matching is the first step for generating a view definition and
program. Knowledge based applications that make use of schema matching help in alignment of
ontologies.

Proposed system:
Existing schema matching tools are rule based. We will study and enhance machine learning
based schema matching tool flex matcher as part of our project. With the help of flex matcher
tool we can map complex metadata structures is a crucial in a number of domains such as data
integration, ontology alignment or model management. To speed up the generation of such
mappings, automatic matching systems were developed to compute mapping suggestions that
can be corrected by a user. We propose a self-configuring schema matching system that is able to
automatically adapt to the given mapping problem at hand. With the help of flex matcher tool we
can achieve it. Our approach is based on analyzing the input schemas as well as intermediate
matching results.

Hardware requirements:
RAM: 8GB OR 10GB.
OPERATING SYSTEM: WINDOWS 8 OR 10.
HARD DISK: up to 10tb

Software requirements:
Windows 8 and above versions can be used to use the software and the develop it. Language
used is Python and Visual Studio Code to code with python.

Domain: Data science using machine learning tool.

Roll no Name Signature

160317737031 Syed zaheer uddin

160317737040 Salman bin yousuf

160317737042 Mohammed Abdul rahman