Graph Database Matching Task

A Graph Database Matching Task is a database matching task that accepts two or more graph structures.

• AKA: Graph-Nodes Interlinking Task.
• Context:
  • Input: two or more Ontologies.
  • output: a Ontology Matching Structure (between ontology concepts).
  • It can be solved by an Ontology Mapping System that applies an (Ontology Mapping Algorithm.
  • It can support an Ontology Merging Task.
  • It can range from being a Heuristic Graph Mapping Task to being a Data-Driven Graph Mapping Task.
  • …
• Example(s):
  • a Terminology Mapping Task.
  • a Taxonomy Mapping Task.
  • an Ontology Mapping Task.
  • a Graph Node-based Classification Task.
• See: Multiclass Classification Task.

---

---