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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Concurrency and computation Ročník 33; číslo 8
Hlavní autori:	Zheng, Zhi‐yun, Wang, Chen‐yu, Ding, Yang, Li, Lun, Li, Dun
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc 25.04.2021
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!