Ontology-based top-k global schema generation




Wei, Yuzhe


Journal Title

Journal ISSN

Volume Title




Global schema generation is the problem of generating a unified schema based on existing heterogeneous local schemas and a set of correspondences which are generated by a schema matching algorithm. The current schema integration approaches cannot satisfy users' requirements due to several reasons. The existing approaches cannot handle hierarchical schema structure, cannot solve conflicts problems, and only generates one merging result. To deal with these kinds of problems, top-k global schema generation approach is proposed in this research. The proposed approach consists of three steps: (1) Relational schemas are converted to ontologies; (2) Ontologies are merged and top-k results are generated; (3) Users can choose one of the top-k merged ontologies and convert it back to the relational schema. The approach utilizes ontology as a base merging model to create the global schema, because ontology can provide semantic and detail constraints. The objective of this research is to generate the global schema with high quality but less user involvement. Since different users may have their own preferred global schemas, top-k ranking algorithms are utilized to obtain multiple schema integration results, so users may have more than one choice. After comparing the approach in this research with state of the art schema integration approaches, the proposed approach better preserves the hierarchical structure, and generates the global schema with higher quality.


A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science


top-k, schema integration, ontology



This material is made available for use in research, teaching, and private study, pursuant to U.S. Copyright law. The user assumes full responsibility for any use of the materials, including but not limited to, infringement of copyright and publication rights of reproduced materials. Any materials used should be fully credited with its source. All rights are reserved and retained regardless of current or future development or laws that may apply to fair use standards. Permission for publication of this material, in part or in full, must be secured with the author and/or publisher.