Pre-matching: Large XML Schemas Decomposition Approach

Authors:
Sana Sellami;Aïcha-Nabila Benharkat;Youssef Amghar
Affiliations:
CNRS, INSA-Lyon, LIRIS, UMR5205, University of Lyon, France F-69621;CNRS, INSA-Lyon, LIRIS, UMR5205, University of Lyon, France F-69621;CNRS, INSA-Lyon, LIRIS, UMR5205, University of Lyon, France F-69621
Venue:
OTM '09 Proceedings of the Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: ADI, CAMS, EI2N, ISDE, IWSSA, MONET, OnToContent, ODIS, ORM, OTM Academy, SWWS, SEMELS, Beyond SAWSDL, and COMBEK 2009
Year:
2009

Citing 2
Cited 0

DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Matching large schemas: Approaches and evaluation

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a decomposition approach, as a pre-matching phase, which break down large XML schemas into smaller sub-schemas to improve the quality of large schema matching. Our approach identifies and extracts common structures between and within XML schemas (inter and intra-schemas) and finds the sub-schemas candidates for matching.