A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
In this paper, we propose a new approach for the computation of the statistics of knowledge graphs. We introduce a schema graph that represents the main framework for the computation of the statistics. The core of the procedure is an algorithm that determines the sub-graph of the schema graph affected by the insertion of one triple into the triple-store. We first present the algorithms that use the minimal schema and the complete schema of a knowledge graph. Furthermore, we propose an algorithmarXiv:2109.09391v1 fatcat:likt2tedubgs3ks2mopdzddx2y