Semantic integration of semistructured and structured data sources
ACM SIGMOD Record
Learning to map between ontologies on the semantic web
Proceedings of the 11th international conference on World Wide Web
A System for Approximate Tree Matching
IEEE Transactions on Knowledge and Data Engineering
Matching Hierarchical Structures Using Association Graphs
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume II - Volume II
Using Schema Matching to Simplify Heterogeneous Data Translation
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The Knowledge Engineering Review
Integrating multiple internet directories by instance-based learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Why is schema matching tough and what can we do about it?
ACM SIGMOD Record
Managing Uncertainty in Schema Matcher Ensembles
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
Theories of meaning in schema matching: An exploratory study
Information Systems
Advances in Web Semantics I
OntoMatch: a monotonically improving schema matching system for autonomous data integration
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Tuning the ensemble selection process of schema matchers
Information Systems
Matching hierarchical classifications with attributes
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
The generation Y of XML schema matching panel description
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
| Hi-index | 0.00 |
One of the key challenges in the development of open semantic-based systems is enabling the exchange of meaningful information across applications which may use autonomously developed schemata. One of the typical solutions for that problem is the definition of a mapping between pairs of schemas, namely a set of point–to–point relations between the elements of different schemas. A lot of (semi-)automatic methods for generating such mappings have been proposed. In this paper we provide a preliminary investigation on the notion of correctness for schema matching methods. In particular we define different notions of soundness, strictly depending on what dimension (syntactic, semantic, pragmatic) of the language the mappings are defined on. Finally, we discuss some preliminary conditions under which a two different notions of soundness (semantic and pragmatic) can be related.