Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/sc/ZhaoZLHH0LC19
%A Zhao, Jin
%A Zhang, Yu
%A Liao, Xiaofei
%A He, Ligang
%A He, Bingsheng
%A Jin, Hai
%A Liu, Haikun
%A Chen, Yicheng
%B SC
%D 2019
%E Taufer, Michela
%E Balaji, Pavan
%E Peña, Antonio J.
%I ACM
%K dblp
%P 3:1-3:14
%T GraphM: an efficient storage system for high throughput of concurrent graph processing.
%U http://dblp.uni-trier.de/db/conf/sc/sc2019.html#ZhaoZLHH0LC19
%@ 978-1-4503-6229-0
@inproceedings{conf/sc/ZhaoZLHH0LC19,
added-at = {2021-10-14T00:00:00.000+0200},
author = {Zhao, Jin and Zhang, Yu and Liao, Xiaofei and He, Ligang and He, Bingsheng and Jin, Hai and Liu, Haikun and Chen, Yicheng},
biburl = {https://www.bibsonomy.org/bibtex/2205c3d1642e33d965b64f59b40e1faf4/dblp},
booktitle = {SC},
crossref = {conf/sc/2019},
editor = {Taufer, Michela and Balaji, Pavan and Peña, Antonio J.},
ee = {https://doi.org/10.1145/3295500.3356143},
interhash = {4cc5055837a629f16e7d1ddf426f87ac},
intrahash = {205c3d1642e33d965b64f59b40e1faf4},
isbn = {978-1-4503-6229-0},
keywords = {dblp},
pages = {3:1-3:14},
publisher = {ACM},
timestamp = {2024-04-10T09:19:30.000+0200},
title = {GraphM: an efficient storage system for high throughput of concurrent graph processing.},
url = {http://dblp.uni-trier.de/db/conf/sc/sc2019.html#ZhaoZLHH0LC19},
year = 2019
}