To decrease the time of generating a closure, a parallel algorithm of generating the closure of a resource description framework schema （RDFS） source is presented. In the algorithm, RDFS triples in the source are cl...To decrease the time of generating a closure, a parallel algorithm of generating the closure of a resource description framework schema （RDFS） source is presented. In the algorithm, RDFS triples in the source are classified according to the forms of triples in the entailment rules and it reduces the scope of searching for specific triples. The dependence among the classes of triples is analyzed. Based on the classification, the initial RDFS source is partitioned into several subsets. The subsets are distributed to each process, and the closure is generated in parallel by applying the RDFS entailment rules. Parallel generating the closure of an RDFS source takes less time and increases efficiency.展开更多
基金国家自然科学基金(the National Natural Science Foundation of China under Grant No.60773100)教育部科学技术研究重点项目(theKey Scientific and Technical Research Project of Ministry of Education of China under Grant No.205014)河北省教育厅科研计划项目(the Science Research Plan of the Office of Education of Hebei under Grant No.2006143)
基金The Weaponry Equipment Foundation of PLA Equipment Ministry (No.51406020105JB8103).
文摘To decrease the time of generating a closure, a parallel algorithm of generating the closure of a resource description framework schema （RDFS） source is presented. In the algorithm, RDFS triples in the source are classified according to the forms of triples in the entailment rules and it reduces the scope of searching for specific triples. The dependence among the classes of triples is analyzed. Based on the classification, the initial RDFS source is partitioned into several subsets. The subsets are distributed to each process, and the closure is generated in parallel by applying the RDFS entailment rules. Parallel generating the closure of an RDFS source takes less time and increases efficiency.
