Incremental Validation of RDF Graphs

With the scale of RDF graph data dramatically increasing, the demands for specifying constraints on RDF graphs and detecting violations of such constraints become urgent. Recently, the validation of RDF graphs has been attracting increasing research efforts, among which ShEx (Shape Expressions) and SHACL (Shapes Constraint Language) are widely used. However, incremental validation of RDF graphs still needs further study. To this end, we propose an incremental validation method of RDF graphs. Our method differentiates the types of constraint, adjusts the order of schema validation, and validates RDF graphs from a graph theory perspective as well as incrementally validates RDF graphs updates. The experimental results show that the incremental validation method proposed in this paper improves the efficiency of the validation of knowledge graphs updates.