Recent innovations in research and development have enabled us to observe the world from different dimensions. Thanks to the technologies that helped us to achieve these objectives efficiently. Often in the real world, we need to find a suitable trade-off. However, the selection of suitable and reasonable trade-offs is an art within itself. While modeling semantics, we often require a hierarchical or relational (triples) representation. Decentralized systems fail to model semantic interoperability implicitly. To fill this gap the proposed work introduces a semantic federated querying scheme for decentralized systems. The proposed approach utilizes state-of-the-art graph technology to model decentralized Knowledge Graphs. Furthermore, we discussed different scenarios where the proposed methodology leads to a reasonable conclusion.
Munir S., Ferretti S. (2023). Towards Federated Decentralized Querying on Knowledge Graphs. 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA : Institute of Electrical and Electronics Engineers Inc. [10.1109/CSCI62032.2023.00104].
Towards Federated Decentralized Querying on Knowledge Graphs
Ferretti S.
2023
Abstract
Recent innovations in research and development have enabled us to observe the world from different dimensions. Thanks to the technologies that helped us to achieve these objectives efficiently. Often in the real world, we need to find a suitable trade-off. However, the selection of suitable and reasonable trade-offs is an art within itself. While modeling semantics, we often require a hierarchical or relational (triples) representation. Decentralized systems fail to model semantic interoperability implicitly. To fill this gap the proposed work introduces a semantic federated querying scheme for decentralized systems. The proposed approach utilizes state-of-the-art graph technology to model decentralized Knowledge Graphs. Furthermore, we discussed different scenarios where the proposed methodology leads to a reasonable conclusion.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
