2021/09/20 by Iztok Savnik, Savnik, Iztok, Kiyoshi Nitta +5
Computer Science · #68 Computer Science #Advanced Database Systems and Queries #Data Management and Algorithms #Databases (cs.DB) #E.2 #FOS: Computer and information sciences #H.2 #Semantic Web and Ontologies
paper · pdf · doi:10.48550/arxiv.2109.09391
openalex publication_date 2021/09/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 algorithm in which the size of the schema graph can be controlled -- it is based on the n levels from the upper part of the schema graph. We evaluate the algorithms empirically by using the Yago knowledge graph.