Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Conflict-Free UDM Graph

Handbook of Research on E-Business Standards and Protocols: Documents, Data and Advanced Web Technologies
Is a UDM graph where no conflictingly nested elements are merged. The conflict-free UDM graph is a directed acyclic graph. Every way properties are nested in the conflict-free UDM graph can be found in at least one schema.
Published in Chapter:
Unified Data Model for Large-Scale Multi-Schema Integration (ULMI)
Michael Dietrich (SAP Research Karlsruhe, Germany) and Jens Lemcke (SAP Research Karlsruhe, Germany)
DOI: 10.4018/978-1-4666-0146-8.ch020
Abstract
Current approaches in schema mapping and matching focus on pair-wise comparison of schemas. This chapter gives an overview of how n-way comparison of schemas via a unified data model for large-scale multi-schema integration (ULMI) can benefit to schema matching and mapping processes. The approach integrates a set of input schemas into one comprehensive representation. Thus, a unified data model is constructed. The unified data model represents the closure of all integrated schemas. However, as the unified data model is too complex and too large, it is never revealed to the user. Therefore, the authors derive a canonical data model which represents the most common structure of all schemas. In a use case, the advantages of the canonical data model are demonstrated. Finally, challenges for further research are derived. This work is based on excerpts from realistic input schemas, and it provides a concrete, ideal canonical data model as a reference for further research.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR