Computing structural similarity of source XML schemas against domain XML schema

Jianxin Li, C. Liu, J.X. X. Yu, J. Liu, G. Wang, C. Yangt

    Research output: Chapter in Book/Conference paperConference paperpeer-review

    2 Citations (Scopus)


    In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the quality of searching and ranking big volume of source documents on the Web with the help of structural information. After analyzing the improperness of adopting existing edit-distance based methods, we propose a new similarity measure model that caters for the requirements of the problem. Given the asymmetric nature of the similarity comparisons of source schemas with a domain schema, similarity preserving rules and algorithm are designed to filter out uninteresting elements in source schemas for the purpose of optimizing the similarity computation. Based on the model, a basic algorithm and an improved algorithm are developed for structural similarity computation. The improved algorithm makes full use of a new coding scheme that is devised to reduce the number of comparisons. Complexities of both algorithms are analyzed and extensive experiments are conducted showing the significant performance gain achieved by the improved algorithm. © 2008, Australian Computer Society, Inc.
    Original languageEnglish
    Title of host publicationConferences in Research and Practice in Information Technology Series
    Number of pages10
    Publication statusPublished - 2008
    Event19th Australasian Database Conference - Wollongong, NSW
    Duration: 1 Jan 20081 Jan 2008


    Conference19th Australasian Database Conference
    Abbreviated titleADC 2008


    Dive into the research topics of 'Computing structural similarity of source XML schemas against domain XML schema'. Together they form a unique fingerprint.

    Cite this