Semantic integration of semistructured and structured data sources
ACM SIGMOD Record
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Schema matching for transforming structured documents
Proceedings of the 2005 ACM symposium on Document engineering
XML schema clustering with semantic and hierarchical similarity measures
Knowledge-Based Systems
Matching large schemas: Approaches and evaluation
Information Systems
A novel method for measuring semantic similarity for XML schema matching
Expert Systems with Applications: An International Journal
Ontology based framework for data integration
WSEAS Transactions on Information Science and Applications
Implementation of semantic services in enterprise application integration
WSEAS Transactions on Computers
A framework and implementation of information content reasoning in a database
WSEAS Transactions on Information Science and Applications
Performance oriented schema matching
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
A framework for schema matcher composition
WSEAS Transactions on Computers
Hi-index | 0.00 |
The integration of different data structures e.g. relational databases of information systems is a current issue in the area of information sciences. Numerous solutions aroused recently aiming to achieve a high accuracy in similarity measurement and integration of schema entities coming from different schemas. Researches usually properly evaluate the capabilities of these approaches from the point of view of accuracy. However the computational complexity of the proposed algorithms is hardly ever examined in the most of these works. We claim that efficiency of a solution can only be judged by taking into account both the accuracy and the computational requirements of participating algorithms. Since there are many known measurement methods and metrics for the evaluation of accuracy, the focus is set for the analysis of their computational complexity in this paper. After the problem formulation the main ideas behind our method are presented. Various approximation techniques and methods of applied algorithm theory are used to evaluate the different approaches. Three specific approaches were also selected to present the work of our method in details on them. Experiments run on several test inputs are also included.