With the rise of hyperlinked networks and the broad spectrum of information that is accessible over the Web, a lot of data sources become available. XML standard receives large acceptance, the comparison of the Web to a “database” is closer to reality than ever before. One of the long-standing and challenging problems for many applications, is schema matching. While there are many schema-matching algorithms proposed in the literature to tackle this problem, most of them are not tackling the indirect mappings, just the few ones do, but still there is a need to cover the special cases of XML schemas. In this paper, we propose a new composite approach that detects direct and indirect mappings for XML schemas with higher accuracy, by proposing algorithms for XML schema matching, after combining them, to detect most kinds of mappings. Our approach to automating XML Schema matching combines terminological mappings with the data value characteristics and the expected data values for the eleme