![]() |
个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职:teaching
性别:男
毕业院校:重庆大学
学位:博士
所在单位:软件学院、国际信息与软件学院
学科:软件工程. 计算机软件与理论
办公地点:开发区综合楼405
联系方式:Email: zkchen@dlut.edu.cn Moble:13478461921 微信:13478461921 QQ:1062258606
电子邮箱:zkchen@dlut.edu.cn
BRGP: a balanced RDF graph partitioning algorithm for cloud storage
点击次数:
论文类型:期刊论文
发表时间:2017-07-25
发表刊物:CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
收录刊物:SCIE、EI、Scopus
卷号:29
期号:14,SI
ISSN号:1532-0626
关键字:cloud storage; RDF; balanced clustering partition; multi-level label propagation
摘要:The continuous growth of resource description framework (RDF) data poses an important challenge on RDF data partitioning that is a vital technique for effective cloud storage. Recently, many partitioning algorithms for large RDF data have been developed, and most of them are based on graph partitioning. However, existing graph partitioning methods could not partition asymmetric RDF data effectively, resulting in a lower performance for cloud storage. This paper proposes a balanced RDF graph partitioning algorithm for storing massive RDF data on cloud. We first devise a modularity-based multi-level label propagation algorithm (MMLP) to partition RDF graph roughly and then use a balanced K-mediods clustering algorithm for final k-way partitioning. Balanced RDF graph partitioning algorithm designs an effective label update rule and a balanced modification strategy to achieve a high quality coarsening result and make the partition as equilibrium as possible. Experiments are carried on two representative RDF benchmarks and one real RDF dataset by comparison with two representative graph partitioning methods, that is, METIS and MLP+METIS. Results demonstrate that our proposed scheme can produce a high-quality partition for massive RDF data storage on cloud. Copyright (C) 2016 John Wiley & Sons, Ltd.