Knowledge graph-based data integration is a practical methodology for heterogeneous legacy database-integrated service construction. However, it is neither efficient nor economical to build a new cross-domain knowledge graph on top of the schemas of each legacy database for the specific integration application rather than reusing the existing high-quality knowledge graphs. Consequently, a question arises as to whether the existing knowledge graph is compatible with cross-domain queries and with heterogenous schemas of the legacy systems. An effective criterion is urgently needed in order to evaluate such compatibility as it limits the quality upbound of the integration. This research studies the semantic similarity of the schemas from the aspect of properties. It provides a set of in-depth criteria, namely coverage and flexibility, to evaluate the pairwise compatibility between the schemas. It takes advantage of the properties of knowledge graphs to evaluate the overlaps between schemas and defines the weights of entity types in order to perform precise compatibility computation. The effectiveness of the criteria obtained to evaluate the compatibility between knowledge graphs and cross-domain queries is demonstrated using a case study.

Property-based semantic similarity criteria to evaluate the overlaps of schemas / Huang, L.; Zhao, Y.; Wang, B.; Zhang, D.; Zhang, R.; Das, S.; Bocca, S.; Giunchiglia, F.. - In: ALGORITHMS. - ISSN 1999-4893. - 14:8(2021), pp. 24101-24119. [10.3390/a14080241]

Property-based semantic similarity criteria to evaluate the overlaps of schemas

Wang B.;Zhang R.;Das S.;Bocca S.;Giunchiglia F.
2021

Abstract

Knowledge graph-based data integration is a practical methodology for heterogeneous legacy database-integrated service construction. However, it is neither efficient nor economical to build a new cross-domain knowledge graph on top of the schemas of each legacy database for the specific integration application rather than reusing the existing high-quality knowledge graphs. Consequently, a question arises as to whether the existing knowledge graph is compatible with cross-domain queries and with heterogenous schemas of the legacy systems. An effective criterion is urgently needed in order to evaluate such compatibility as it limits the quality upbound of the integration. This research studies the semantic similarity of the schemas from the aspect of properties. It provides a set of in-depth criteria, namely coverage and flexibility, to evaluate the pairwise compatibility between the schemas. It takes advantage of the properties of knowledge graphs to evaluate the overlaps between schemas and defines the weights of entity types in order to perform precise compatibility computation. The effectiveness of the criteria obtained to evaluate the compatibility between knowledge graphs and cross-domain queries is demonstrated using a case study.
8
Huang, L.; Zhao, Y.; Wang, B.; Zhang, D.; Zhang, R.; Das, S.; Bocca, S.; Giunchiglia, F.
Property-based semantic similarity criteria to evaluate the overlaps of schemas / Huang, L.; Zhao, Y.; Wang, B.; Zhang, D.; Zhang, R.; Das, S.; Bocca, S.; Giunchiglia, F.. - In: ALGORITHMS. - ISSN 1999-4893. - 14:8(2021), pp. 24101-24119. [10.3390/a14080241]
File in questo prodotto:
File Dimensione Formato  
2021 matching-algorithms-14-00241 (1).pdf

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Creative commons
Dimensione 2.87 MB
Formato Adobe PDF
2.87 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11572/319683
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact