Design patterns for efficient graph algorithms in mapreduce (2010)

by Jimmy Lin , Michael Schatz
Venue:In MLG ’10: Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Citations:39 - 4 self

Documents Related by Co-Citation

12796 Computers and Intractability: A Guide to the Theory of NP-completeness – M R Garey, D S Johnson - 1978
11663 The Nature of Statistical Learning Theory – Vladimir N. Vapnik - 1999
2833 MapReduce: Simplified Data Processing on Large Clusters – Jeffrey Dean, et al. - 2004
396 Pregel: A system for large-scale graph processing – Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski - 2010
2909 The PageRank Citation Ranking: Bringing Order to the Web – Lawrence Page, Sergey Brin, Rajeev Motwani, Terry Winograd - 1999
1312 A Bridging Model for Parallel Computation – Leslie G Valiant - 1990
676 Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks – Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, Dennis Fetterly - 2007
871 Bigtable: A distributed storage system for structured data – Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, Robert E. Gruber - 2006
1326 The Google File System – Sanjay Ghemawat, Howard Gobioff, Shun-tak Leung