"Minimum motif-cut: a workload-aware RDF graph partitioning strategy."

Peng Peng et al. (2024)

> Home

Details and statistics

DOI: 10.1007/S00778-024-00860-1

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/vldb/PengJOZ24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/vldb/PengJOZ24
Peng Peng, Shengyi Ji, M. Tamer Özsu, Lei Zou:
Minimum motif-cut: a workload-aware RDF graph partitioning strategy. VLDB J. 33(5): 1517-1542 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.