Minimum motif-cut: a workload-aware RDF graph partitioning strategy
Crossref DOI link: https://doi.org/10.1007/s00778-024-00860-1
Published Online: 2024-07-08
Published Print: 2024-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Peng, Peng
Ji, Shengyi
Özsu, M. Tamer
Zou, Lei https://orcid.org/0000-0002-8586-4400
Text and Data Mining valid from 2024-07-08
Version of Record valid from 2024-07-08
Article History
Received: 23 April 2023
Revised: 15 May 2024
Accepted: 3 June 2024
First Online: 8 July 2024