Abstract: The approach proposed in this study uses a simple path matching algorithm to perform the structural matching. The novelty in this approach is that the path matching algorithm considers only the paths to leaf nodes in the schema trees for the matching process there by eliminating the need for repeatedly parsing the elements of the schema tree as in the other approaches. This greatly reduces the time required to identify the matches. And the paths are treated as a set of strings comprising of the labels of the nodes in the path. Treating the paths as set of strings greatly simplifies the matching process as the same approaches used in the linguistic matching process can be used in the path matching process.