|Table of Contents|

[1] Miao Zhuang, Zhang Yafei, Lu Jianjiang, Song Zilin, et al. Parallel algorithm of generating closure of RDFS source [J]. Journal of Southeast University (English Edition), 2006, 22 (3): 435-438. [doi:10.3969/j.issn.1003-7985.2006.03.031]
Copy

Parallel algorithm of generating closure of RDFS source()
RDFS数据源的并行闭包生成算法
Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
22
Issue:
2006 3
Page:
435-438
Research Field:
Automation
Publishing date:
2006-09-30

Info

Title:
Parallel algorithm of generating closure of RDFS source
RDFS数据源的并行闭包生成算法
Author(s):
Miao Zhuang1, Zhang Yafei2, Lu Jianjiang1, Song Zilin1
1Institute of Command Automation, PLA University of Science and Technology, Nanjing 210007, China
2Training Department, PLA University of Science and Technology, Nanjing 210007, China
苗壮1, 张亚非2, 陆建江1, 宋自林1
1解放军理工大学指挥自动化学院, 南京 210007; 2解放军理工大学训练部, 南京 210007
Keywords:
parallel;  closure;  resource description framework(RDF)graph;  RDFS source
并行;  闭包;  RDF图;  RDFS数据源
PACS:
TP182
DOI:
10.3969/j.issn.1003-7985.2006.03.031
Abstract:
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.
为了减少闭包的生成时间, 提出了一种RDFS数据源闭包的并行生成算法.该算法基于RDFS推理规则生成闭包, 根据三元组的形式对数据源中的RDFS三元组进行分类, 缩小了特定形式三元组的直找范围;分析了各类三元组间的推理依赖关系, 并按照每条推理规则所需的三元组将初始的数据源划分成多个子集, 将子集导入各个并行的进程中, 并应用RDFS推理规则并行地生成闭包.并行的闭包生成算法可以有效地减少运行时间以提高闭包生成的效率.

References:

[1] Hayes P.RDF semantics [EB/OL].(2004-02-10)[2006-01-30].http://www.w3.org/TR/2004/REC-rdf-mt-20040210/.
[2] Lassila O.Taking the RDF model theory out for a spin [A].In:Lecture Notes in Computer Science[C].Springer-Verlag, 2002, 2342:307-317.
[3] Wielemaker J, Schreiber G, Wielinga B.Prolog-based infrastructure for RDF:scalability and performance [A].In:Lecture Notes in Computer Science[C].Springer-Verlag, 2003, 2870:644-658.
[4] Christophides V, Plexousakis D, Scholl M, et al.On labeling schemes for the semantic web [A].In:Proceedings of the 12th International World Wide Web Conference [C].Budapest, Hungary, 2003.544-555.
[5] Broekstra J.Storage, querying and inferencing for semantic web languages [D].Amsterdam, Netherlands:Vrije University, 2005.
[6] Broekstra J, Kampman A, van Harmelen F.Sesame:a generic architecture for storing and querying RDF and RDF schema [A].In: Lecture Notes in Computer Science[C]. Springer-Verlag, 2002, 2342:54-68.
[7] Hayes P.RDF model theory [EB/OL].(2004-02-10)[2006-01-30].http://www.w3.org/TR/2002/WD-rdf-mt-20020429/.

Memo

Memo:
Biographies: Miao Zhuang(1976—), male, graduate;Zhang Yafei(corresponding author), male, doctor, professor, yf-zhang888@sina.com.
Last Update: 2006-09-20