Let High-level Graph Queries Be Parallel Efficient: An Approach Over Structural Recursion On Pregel.
https://doi.org/10.2197/ipsjjip.24.928
@article{DBLP:journals/jip/LiTMH16,
author = {Chong Li and
Le{-}Duc Tung and
Xiaodong Meng and
Zhenjiang Hu},
title = {Let High-level Graph Queries Be Parallel Efficient: An Approach Over
Structural Recursion On Pregel},
journal = {{JIP}},
volume = {24},
number = {6},
pages = {928--936},
year = {2016},
url = {https://doi.org/10.2197/ipsjjip.24.928},
doi = {10.2197/ipsjjip.24.928},
timestamp = {Sun, 28 May 2017 13:19:57 +0200},
biburl = {https://dblp.org/rec/journals/jip/LiTMH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签