Distributed Storage of RDF Based on Clustering

DOI

10.2991/cmes-15.2015.182How to use a DOI?

Keywords

RDF, directed graph, P-Rank, clustering.

Abstract

With the wide application of RDF(Resource Description Framework) data, the data volume grows rapidly. Therefore, RDF storage has become a hot research issue in data storage field currently. Distributed storage is an effective way to solve the storage and query of RDF data, and data partition is the premise of data distributed storage. In this paper we use graph clustering idea to realize the effective partition of RDF data. RDF can be described as a directed graph, so in this paper we use P-Rank (Penetrating Rank) algorithm to calculate the similarity of RDF graph node pairss, and then the improved K-means clustering algorithm is implemented to cluster the similarity results, so as to realize the distributed storage of RDF data. The experimental results show that, this method can complete the RDF data partition effectively, makes the intra-cluster similarity is smaller, and the larger the inter-cluster similarity.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yonglin Leng
AU  - Fuyu Lu
PY  - 2015/04
DA  - 2015/04
TI  - Distributed Storage of RDF Based on Clustering
BT  - Proceedings of the 2nd International Conference on Civil, Materials and Environmental Sciences
PB  - Atlantis Press
SP  - 671
EP  - 673
SN  - 2352-5401
UR  - https://doi.org/10.2991/cmes-15.2015.182
DO  - 10.2991/cmes-15.2015.182
ID  - Leng2015/04
ER  -