n-graph matching: simplify data integration

DESCRIPTION

• An innovative software to fast match n-graphs
• Single-pass instead of multiple 2-graph matchings:
  - Heterogenous data schemas are converted into graphs
  - Outputs an integrated graph and the underlying matchings
  - Integrated graph is converted into a multidimensional schema
• Maximizes semantic and syntactic similarity
• No threshold tuning required
• Find globally optimal solutions
• User can validate and adjust the proposed solution

APPLICATIONS

• Business Intelligence
• Data warehouse
• Open Data
• Bioinformatics
• Ontology matching