The Formal Graph of APRDF

Abstract

A new alternative model for expressing more complex knowledge has been proposed as an attributed predicate RDF (APRDF). By handling attributes that represent any additional triples of the main triple, APRDF serves as a predicate. Therefore, the formal graph model of APRDF must be defined. Lastly, this work recommends that the APRDF's conventional diagram is a digraph-hypergraph mix. The previous formal graph of RDF is a hypergraph even though, visually intuitively, it is a digraph. It also contains inconsistency. The other new serialization needs to describe its formal model. Eventually, this work can provide the formal graph model of APRDF and maintain consistency. There have been a few definitions proposed. The direct impact of this formal model is that APRDF outperformed the other model significantly when retrieving complex queries within its formal graph. In querying, the initial implementation of the proposed formal graph takes an average of 62 milliseconds. Compared to the other graph models, the proposed formal graph can reduce query time by an average of 90,7 milliseconds on the BF-arch graph and 121,05 milliseconds on the naive/default graph. As the formal graph model is preserved, the attributed predicate of APRDF assumed will drive a new model in the retrieving process that more in using a predicate formed as a link in a graph. It will also be impacted in the mining process by more elaborate links/edges (link mining).