搜索历史记录选项已关闭,请开启搜索历史记录选项。
作者: Isabelle Stanton , Gabriel Kliot
DOI: 10.1145/2339530.2339722
关键词:
摘要: … We consider a simple streaming graph model. We have a cluster of k machines, each with memory capacity C, such that the total capacity, kC, is large enough to hold the whole …
arXiv: Distributed, Parallel, and Cluster Computing,2014, 引用: 7
arXiv: Data Structures and Algorithms,2012, 引用: 9
operating systems design and implementation,2012, 引用: 2,242
Proceedings of the VLDB Endowment,2012, 引用: 64
,2012, 引用: 6
Graph algorithms in the internet age,2012, 引用: 0
Proceedings of the VLDB Endowment,2013, 引用: 272
,2014, 引用: 7
algorithm engineering and experimentation,2015, 引用: 5
arXiv: Distributed, Parallel, and Cluster Computing,2015, 引用: 9