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

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
2023 MapReduce: Simplified Data Processing on Large Clusters – Jeffrey Dean, et al. - 2004
207 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, Google Inc - 2010
2401 The PageRank Citation Ranking: Bringing Order to the Web – Lawrence Page, Sergey Brin, Rajeev Motwani, Terry Winograd - 1999
1184 A bridging model for parallel computation – L G Valiant - 1990
609 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
3648 The Anatomy of a Large-Scale Hypertextual Web Search Engine – Sergey Brin, Lawrence Page - 1998
517 Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks – Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, Dennis Fetterly - 2007
2163 Collective dynamics of small-world networks – Duncan J Watts, Steven H Strogatz - 1998