13,341 Hits in 8.4 sec

Mapping relational databases through ontology matching: a case study on information migration

Manuel Rodriguez-Mancha, Hector G. Ceballos, Francisco J. Cantu, Aldo Diaz-Prado
2011 International Semantic Web Conference  
We propose a methodology for mapping two relational databases that uses ontology matching techniques and takes advantage of tools like D2R Server and AgreementMaker for automating mapping generation and  ...  Despite the facilities provided by these techniques, mappings between database schemas are still made manually.  ...  A database mapping methodology based on ontology matching techniques Counting with experts for both databases/systems during data migration is really exceptional, therefore we propose using training data  ... 
dblp:conf/semweb/Rodriguez-ManchaCCD11 fatcat:7bmh7zjmbfbnbmpnmkcbgo4aku

Recent Advances in Schema and Ontology Evolution [chapter]

Michael Hartung, James Terwilliger, Erhard Rahm
2010 Schema Matching and Mapping  
We then give an overview about the current state of the art and recent research results for the evolution of relational schemas, XML schemas, and ontologies.  ...  by providing and maintaining views or schema versions), automated generation of evolution mappings, and predictable instance migration that minimizes data loss and manual intervention.  ...  PRISM adds value by enabling versioning through inter-version mappings, forward and backward compatibility, and formal guarantees of information preservation when applicable.  ... 
doi:10.1007/978-3-642-16518-4_6 fatcat:nx56hsjqnzaedihtc7cthjqaby

Instance-Based Ontology Matching by Instance Enrichment

Balthasar Schopman, Shenghui Wang, Antoine Isaac, Stefan Schlobach
2012 Journal on Data Semantics  
We have applied the IBOMbIE algorithm in a real-life use-case where large datasets are used to match the ontologies of European libraries.  ...  Instance-based ontology matching (IBOM) uses the extension of concepts, the instances directly associated with a concept, to determine whether a pair of concepts is related or not.  ...  Related Work Instance Matching Instance matching is a fundamental problem in many application domains, such as E-business, data migration and integration, information sharing and communication, web service  ... 
doi:10.1007/s13740-012-0011-z fatcat:qyclrbqi6reg3ibiu7wpjw6sla

Semantic Enrichment in Ontologies for Matching

Nwe Ni Tun, Satoshi Tojo
2006 International Journal on Semantic Web and Information Systems (IJSWIS)  
Ontology matching (or mapping) is a process of finding correspondences between semantically related entities in heterogeneous ontologies.  ...  For interoperating among information systems through heterogeneous ontologies, mapping mechanisms need to bridge their knowledge gaps.  ...  In practical cases, information systems employ ontologies together with application databases. Therefore, the concept of a populated ontology is fundamental to several approaches to ontology mapping.  ... 
doi:10.4018/jswis.2006100102 fatcat:bk6b5c724jaanmps5wfj4dvfh4

An Ontology-Matching Based Proposal to Detect Potential Redundancies on Enterprise Architectures

C. Castellanos, D. Correal, F. Murcia
2011 2011 30th International Conference of the Chilean Computer Science Society  
The main idea is to perform a transformation from an EA model towards ontology in OWL format (Ontology Web Language) and exploit ontology matching tools to infer correspondences between concepts.  ...  Evaluating and identifying manually redundant elements in large information systems (IS) is a tedious, errorprone and time-consuming task.  ...  On the other hand, Abstract refers to entities in a relational model or complex data types in XML Schema.  ... 
doi:10.1109/sccc.2011.16 dblp:conf/sccc/CastellanosCB11 fatcat:lecxwseek5hjvdhsynrrnofd5a

Towards Ontology Matching Based System Through Terminological, Structural and Semantic Level

Aroua Essayeh, Mourad Abed
2015 Procedia Computer Science  
The proposed matching system aims to discover in an automatic way, the correspondence links between two intrinsically heterogeneous ontologies, through different techniques of calculations of similarity  ...  For this purpose, a single ontology may not be comprehensive to represent all due to the lack of a common and shared ontology between communities.  ...  In order to build our own system, it was overriding for us to study tools and platforms based on matching algorithms. We enriched the work of 1 which presented a state of art in matching tools.  ... 
doi:10.1016/j.procs.2015.08.154 fatcat:dvkmyixuzfhspmteuupsyouhpu

Using ontologies for users-groups matching in an annotation system

Danilo Avola, Paolo Bottoni, Amjad Hawash
2013 2013 5th International Conference on Computer Science and Information Technology  
Representing a domain knowledge through an ontology allows people and systems to share a common corpus of knowledge for reasoning and communicating.  ...  For example, authors of annotations systematically using tags referrable to some existing ontology can be invited to join groups based on that ontology.  ...  This allows a safer and more focused information exchange through annotations, fostering collaborative discussion threads on the group topics.  ... 
doi:10.1109/csit.2013.6588755 fatcat:53msni7yw5gm3i7ysucsjnsnui

Semantic-based Model Matching with EMFCompare

Lorenzo Addazi, Antonio Cicchetti, Juri Di Rocco, Davide Di Ruscio, Ludovico Iovino, Alfonso Pierantonio
2016 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems  
This paper discusses a lightweight semantic comparison method, which relies on a new matching algorithm that considers ontological information encoded in the WordNet lexical database further than ordinary  ...  Model comparison is one of the most challenging operations playing a central role in a wide range of modelling activities including model versioning, evolution and even collaborative and distributed specification  ...  Synsets are connected to one another through explicit semantic relations.  ... 
dblp:conf/models/AddaziCRRIP16 fatcat:bxg2l6oh6jhqrgq37ymblrcqb4

RésuMatcher: A personalized résumé-job matching system

Shiqiang Guo, Folami Alamudun, Tracy Hammond
2016 Expert systems with applications  
One popular approach to resolve this difficulty for users are recommender systems, which is a technology that has been studied for a long time.  ...  We devised a new statistical-based ontology similarity measure to compare the résumé models and the job models.  ...  We developed a résumé -job matching system. 2.  ... 
doi:10.1016/j.eswa.2016.04.013 fatcat:72ipxgc6dbgufh22n2px7ws2ie

Context matching for electronic marketplaces: a case study

2003 Knowledge engineering review (Print)  
The objective of this paper is the description of a use case in which matching algorithm has been used to re-classify into UN-SPSC the catalogue of the office equipment and accessories used by a worldwide  ...  Matching algorithms automatically discover semantic relations between two autonomously developed conceptual representations of two overlapping domains.  ...  A mapping procedure based on lexical information has been proposed in [Bergamaschi et al., 2002] . No quantitative evaluation is reported.  ... 
doi:10.1017/s0269888904000128 fatcat:exmfnvrnsngfbd3youoy2dhgcu

Enhanced Geographically-Typed Semantic Schema Matching

Jeffrey Partyka, Pallabi Parveen, Latifur Khan, Bhavani Thuraisingham, Shashi Shekhar
2011 Social Science Research Network  
of mapped attributes.  ...  If geographic type matching is not possible, we then apply a generic schema matching method, independent of the knowledge domain, which employs normalized Google distance.  ...  A number of research efforts [1, 2, 47] have focused on instance-based schema matching methods that depend on the semantics embedded in structured information, such as a domain ontology, to identify  ... 
doi:10.2139/ssrn.3199506 fatcat:62tjzqiqg5abnovgixgl7t5qqa

Enhanced geographically typed semantic schema matching

Jeffrey Partyka, Pallabi Parveen, Latifur Khan, B. Thuraisingham, Shashi Shekhar
2011 Journal of Web Semantics  
of mapped attributes.  ...  If geographic type matching is not possible, we then apply a generic schema matching method, independent of the knowledge domain, which employs normalized Google distance.  ...  A number of research efforts [1, 2, 47] have focused on instance-based schema matching methods that depend on the semantics embedded in structured information, such as a domain ontology, to identify  ... 
doi:10.1016/j.websem.2010.11.002 fatcat:ig7o6e3merd6vdhzbzl6sxe47u

Fuzzy Constraint-based Schema Matching Formulation

Alsayed Algergawy, Eike Schallehn, Gunter Saake
2008 Business Information Systems  
Moreover, we could discover complex matches easily. Finally, we could make a trade-off between schema matching performance aspects.  ...  Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy constraint optimization problem FCOP.  ...  web sites ontologies; and in data migration, to migrate legacy data from multiple sources into a new one [9] .  ... 
dblp:conf/bis/AlgergawySS08 fatcat:l2yc4tduc5gitdrotnjh7p7ubq

Prison Break: A Generic Schema Matching Solution to the Cloud Vendor Lock-in Problem

Mohammad Hamdaqa, Ladan Tahvildari
2014 2014 IEEE 8th International Symposium on the Maintenance and Evolution of Service-Oriented and Cloud-Based Systems  
This brings us one step closer to automatic model migration across cloud platforms.  ...  However, schema matching typically relies on linguistic and structural similarities, and cloud schema terms diverge so much that such matching is impossible.  ...  It is a well established practice [5] , widely used for database migration and ontology consolidation [6] , in domains such as linkeddata, telecommunications, e-commerce, and bioinformatics [7] .  ... 
doi:10.1109/mesoca.2014.13 dblp:conf/mesoca/HamdaqaT14 fatcat:amteqnumvzhyhp7xtw2ehthztu

Context-based matching for Web service composition

Brahim Medjahed, Yacine Atif
2006 Distributed and parallel databases  
Finally, we present a peer-to-peer architecture for matching context policies. The architecture relies on a context matching engine, context policy assistants, and context community services.  ...  We first propose an ontology-based categorization of contextual information in Web service environments. We then define a two-level mechanism for modeling Web service contexts.  ...  We adopt a more generic definition of Web service context through an ontology-based categorization of contextual information. Maamar et al.  ... 
doi:10.1007/s10619-006-7003-7 fatcat:5orgue3a3rdnffxk6etr5c56fi
« Previous Showing results 1 — 15 out of 13,341 results