Theoretical Aspects of Schema Merging
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
The Use of Information Capacity in Schema Integration and Translation
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Multi-column substring matching for database schema translation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Merging models based on given correspondences
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Data integration with uncertainty
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Interactive generation of integrated schemas
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Bootstrapping pay-as-you-go data integration systems
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Top-k generation of integrated schemas based on directed and weighted correspondences
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
FCA-MERGE: bottom-up merging of ontologies
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
Schema integration has been widely used in many database applications, such as DataWarehousing, Life Science and Ontology Merging. Though schema integration has been intensively studied in recent yeas, it is still a challenging issue, because it is almost impossible to find the perfect target schema. An automatic method to schema integration, which explores multiple possible integrated schemas over a set of source schemas from the same domain, is proposed in this paper. Firstly, the concept graph is introduced to represent the source schemas at a higher-level of abstraction. Secondly, we divide the similarity between concepts into intervals to generate three merging strategies for schemas. Finally, we design a novel top-k ranking algorithm for the automatic generation of the best candidatemediated schemas. The key component of our algorithmis the pruning technique which uses the ordered buffer and the threshold to filter out the candidates. The extensive experimental studies show that our algorithm is effective and runs in polynomial time.