Generating Closure of RDF Source Based on Tree Structure
Bo Chen · Jisuanji fangzhen · 2008
RDF closure is an effective way to improve the RDF query efficiency.Existing closure algorithms almost perform reasoning according to the triggers among the inference rules which are used repeatedly,and thus the efficiency of closure generation is relatively lower.By virtue of the characteristics of the inference rules of RDF(S)semantics,a closure algorithm was proposed inspired with the idea of the hierarchy structure of trees.Property-tree and concept-tree corresponding to property and concept were respectively built,and the inference rules of RDF(S)semantics were represented with tree structure.RDF triples were stored in the nodes of property-tree and concept-tree.Then the RDF triples were mapped to RDF closure according to the mapping mechanism.Simulation demonstrates that this algorithm greatly improves the efficiency of closure generation.