XML schema matching

Complex schema match discovery and validation through collaboration

Authors: 
Saleem, K; Bellahsene, Z
Year: 
2009
Venue: 
Proc. OTM workshops, LNCS 5870

In this paper, we demonstrate an approach for the discovery and validation of n:m schema match in the hierarchical structures like the XML schemata. Basic idea is to propose an n:m node match between children (leaf nodes) of two matching non-leaf nodes of the two schemata. The similarity computation of the two non-leaf nodes is based upon the syntactic and linguistic similarity of the node labels supported by the similarity among the ancestral paths from nodes to the root.

Schema Covering: a Step Towards Enabling Reuse in Information Integration

Authors: 
Saha, B; Stanoi, I; Clarkson, KL
Year: 
2010
Venue: 
Proc of ICDE Conference

We introduce schema covering, the problem of identifying
easily understandable common objects for describing large
and complex schemas. Defining transformations between schemas
is a key objective in information integration. However, this
process often becomes cumbersome when the schemas are large
and structurally complex. If such complex schemas can be broken
into smaller and simpler objects, then simple transformations
defined over these smaller objects can be reused to define suitable
transformations among the complex schemas. Schema covering

Improving XML Schema Matching Performance Using Prüfer Sequences

Authors: 
Algergawy, Alsayed; Schallehn, Eike; Saake, Gunter
Year: 
2009
Venue: 
Data & Knowledge Engineering , Vol. 68, Issue 8, pp. 728-747, August 2009.

Schema matching is a critical step for discovering semantic correspondences among elements in many data-shared applications. Most of existing schema matching algorithms produce scores between schema elements resulting in discovering only simple matches. Such results partially solve the problem. Identifying and discovering complex matches is considered one of the biggest obstacle towards completely solving the schema matching problem. Another obstacle is the scalability of matching algorithms on large number and large-scale schemas.

Information Systems Integration and Evolution: Ontologies at Rescue

Authors: 
Curino, Carlo A.; Tanca, Letizia; Zaniolo, Carlo
Year: 
2008
Venue: 
STSM

The life of a modern Information System is often characterized by (i) a push toward integration with other systems, and (ii) the evolution of its data management core in response to continuously changing application requirements. Most of the current proposals dealing with these issues from a database perspective rely on the formal notions of mapping and query rewriting.

Learning to Match the Schemas of Data Sources: A Multistrategy Approach

Authors: 
Doan, A.; Domingos, P.; Halevy, A.
Year: 
2003
Venue: 
VLDB 2003

The problem of integrating data from multiple data sources—either on the Internet or within enterprises—has received much attention in the database and AI communities. The focus has been on building data integration systems that provide a uniform query interface to the sources. A key bottleneck in building such systems has been the laborious manual construction of semantic mappings between the query interface and the source schemas. Examples of mappings are ldquoelement location maps to addressrdquo and ldquoprice maps to listed-pricerdquo.

Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem

Authors: 
Smiljanic, M.; van Keulen, M.; Jonker, W.
Year: 
2005
Venue: 
DEXA 2005

The first step in finding an efficient way to solve any difficult
problem is making a complete, possibly formal, problem specification.
This paper introduces a formal specification for the problem of semantic
XML schema matching. Semantic schema matching has been extensively
researched, and many matching systems have been developed. However,
formal specifications of problems being solved by these systems do not
exist, or are partial. In this paper, we analyze the problem of seman-
tic schema matching, identify its main components and deliver a formal

Defining the XML Schema Matching Problem for a Personal Schema Based Query Answering System

Authors: 
Smiljanic, M.; van Keulen, M.; Jonker, W.
Year: 
2004

XML brought several important qualities to data representation. Through the usage of tags, it
combined schema and data information. Tag nesting enabled a simple representation of hierarchical
relations. Such enrichments sparked off a new wave of research on how to improve querying
and searching of data within XML documents.
The Internet is practically an endless collection of data being used simultaneously by millions
of users. We expect that for a large part, this information will become available in XML. As such,

XML mapping technology: Making connections in an XML-centric world

Authors: 
Roth, M; Hernandez, MA; Coulthard, P; Yan, L; Popa, L; Ho, H.C.; Salter, C.C.
Year: 
2006
Venue: 
IBM SYSTEMS JOURNAL

Extensible Markup Language (XML) has grown rapidly over the last decade to become
the de facto standard for heterogeneous data exchange. Its popularity is due in large
part to the ease with which diverse kinds of information can be represented as a result
of the self-describing nature and extensibility of XML itself. The ease and speed with
which information can be represented does not extend, however, to exchanging such
information between autonomous sources. In the absence of controlling standards,
such sources will typically choose differing XML representations for the same concept,

Automating the transformation of XML documents

Authors: 
Su, H; Kuno, H; Rundensteiner, EA
Year: 
2001
Venue: 
Workshop On Web Information And Data Management, 2001

The advent of web services that use XML-based message exchanges has spurred many efforts that address issues related to inter-enterprise service electronic commerce interactions. Currently emerging standards and technologies enable enterprises to describe and advertise their own Web Services and to discover and determine how to interact with services fronted by other businesses. However, these technologies do not address the problem of how to reconcile structural differences between similar types of documents supported by different enterprises.

Reconciling Schemas of Disparate Data Sources: A Machine-Learning Approach

Authors: 
Doan, A.; Domingos, P.; Halevy, A.
Year: 
2001
Venue: 
SIGMOD, 2001

Critical Points for Interactive Schema Matching

Authors: 
Wang, G.; Goguen, J.; Nam, Y.-K.; Lin, K.
Year: 
2004
Venue: 
APWEB, 2004
Syndicate content