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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Concurrency and computation Jg. 33; H. 8
Hauptverfasser:	Zheng, Zhi‐yun, Wang, Chen‐yu, Ding, Yang, Li, Lun, Li, Dun
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc 25.04.2021
Schlagworte:	Algorithms edge partitioning Graph theory minimum degree vertex parallel query Partitioning RDF graph RDF sentence graph Segmentation vertex cut set
ISSN:	1532-0626, 1532-0634
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!