Research on partitioning algorithm based on RDF graph

Summary With the increasing size of the RDF dataset, the application of parallel computing frameworks is applying more and more widely in big data. In order to realize the parallel query of data, an edge partitioning algorithm is proposed based on RDF sentence graph. Firstly, the algorithm transform...

Full description

Saved in:
Bibliographic Details
Published inConcurrency and computation Vol. 33; no. 8
Main Authors Zheng, Zhi‐yun, Wang, Chen‐yu, Ding, Yang, Li, Lun, Li, Dun
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc 25.04.2021
Subjects
Algorithms
edge partitioning
Graph theory
minimum degree vertex
parallel query
Partitioning
RDF graph
RDF sentence graph
Segmentation
vertex cut set
Online AccessGet full text

Cover

More Information
Summary:Summary With the increasing size of the RDF dataset, the application of parallel computing frameworks is applying more and more widely in big data. In order to realize the parallel query of data, an edge partitioning algorithm is proposed based on RDF sentence graph. Firstly, the algorithm transforms the RDF graph into an RDF sentence graph using coarsening and partitioning. Secondly, the minimum degree vertex partitioning algorithm is put forward to partition the RDF sentence graph. Finally, according to the equivalence thought between edge segmentation of RDF sentence and vertex segmentation of RDF graph, the intersection between RDF subgraphs is the vertex cut set of RDF graph to achieve parallel query of RDF data. The experimental results show that the algorithm's partitioning time and efficiency are better than the traditional algorithms.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.5612