The Partition of Semantic Web Data

DOI

10.2991/iiicec-15.2015.12How to use a DOI?

Keywords

semantic web; RDF directed graph; partition; shortest path; AP clustering

Abstract

With the rapid growth of the Semantic Web data, RDF data storage has become a hot research topic in the field of data storage. Distributed storage is an effective way to solve the scalability of RDF data, and data partition is the key to realize the distributed storage. In this paper we use graph clustering idea to realize the effective partition of RDF data. Since the properties of the RDF data model, we presents a similarity measure algorithm based on shortest paths to calculate the similarity between nodes of the RDF graph, then use the AP clustering algorithm to cluster similarity matrix, and realize the partition and distributed storage of RDF data. The experiment results show that, the algorithm can effectively complete the clustering partition of the RDF data, makes the high-similarity nodes fall into one cluster while low similarity nodes are distributed to different clusters.

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/03
DA  - 2015/03
TI  - The Partition of Semantic Web Data
BT  - Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference
PB  - Atlantis Press
SP  - 48
EP  - 51
SN  - 2352-538X
UR  - https://doi.org/10.2991/iiicec-15.2015.12
DO  - 10.2991/iiicec-15.2015.12
ID  - Leng2015/03
ER  -