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

Peng Peng 0001, Shengyi Ji, M. Tamer Özsu, Lei Zou 0001. Minimum motif-cut: a workload-aware RDF graph partitioning strategy. VLDB J., 33(5):1517-1542, September 2024. [doi]

@article{PengJOZ24,
  title = {Minimum motif-cut: a workload-aware RDF graph partitioning strategy},
  author = {Peng Peng 0001 and Shengyi Ji and M. Tamer Özsu and Lei Zou 0001},
  year = {2024},
  month = {September},
  doi = {10.1007/s00778-024-00860-1},
  url = {https://doi.org/10.1007/s00778-024-00860-1},
  researchr = {https://researchr.org/publication/PengJOZ24},
  cites = {0},
  citedby = {0},
  journal = {VLDB J.},
  volume = {33},
  number = {5},
  pages = {1517-1542},
}