The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
One trillion edges: graph processing at Facebook-scale
Abstract
Analyzing large graphs provides valuable insights for social networking and web companies in content ranking and recommendations. While numerous graph processing systems have been developed and evaluated on available benchmark graphs of up to 6.6B edges, they often face significant difficulties in scaling to much larger graphs. Industry graphs can be two orders of magnitude larger - hundreds of billions or up to one trillion edges. In addition to scalability challenges, real world applications often require much more complex graph processing workflows than previously evaluated. In this paper, we describe the usability, performance, and scalability improvements we made to Apache Giraph, an open-source graph processing system, in order to use it on Facebook-scale graphs of up to one trillion edges. We also describe several key extensions to the original Pregel model that make it possible to develop a broader range of production graph applications and workflows as well as improve code reuse. Finally, we report on real-world operations as well as performance characteristics of several large-scale production applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Clustering by Passing Messages Between Data Points
Frey, B. J., & Dueck, D. (2007) · Science · doi:10.1126/science.1136800 · Cited by 6,758
What is Twitter, a social network or a news media?
Kwak, H., Lee, C., Park, H., & Moon, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772751 · Cited by 6,652
(2010) · Cited by 4,411
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 · doi:10.1145/1272996.1273005 · Cited by 2,432
ZooKeeper: wait-free coordination for internet-scale systems
Hunt, P. G., Konar, M., Junqueira, F., & Reed, B. C. (2010) · USENIX Annual Technical Conference · Cited by 1,968
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Pig latin: a not-so-foreign language for data processing
Olston, C., Reed, B., Srivastava, U., Kumar, R., & Tomkins, A. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376726 · Cited by 1,730
Hive: a warehousing solution over a map-reduce framework
Thusoo, A., Sarma, J. S., Jain, N., Shao, Z., Chakka, P., Anthony, S., Liu, H., Wyckoff, P., & Murthy, R. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687609 · Cited by 1,556
Learning from labeled and unlabeled data with label propagation
Zhu, X., & Ghahramani, Z. (2002) · Cited by 1,534
PowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
GraphChi: Large-Scale Graph Computation on Just a PC
Kyrola, A., Blelloch, G. E., & Guestrin, C. (2018) · Figshare · doi:10.1184/r1/6605999 · Cited by 868
Twister: a runtime for iterative MapReduce
Ekanayake, J., Li, H., Zhang, B., Gunarathne, T., Bae, S.-H., Qiu, J., & Fox, G. (2010) · Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing · doi:10.1145/1851476.1851593 · Cited by 777
HaLoop: efficient iterative data processing on large clusters
Bu, Y., Howe, B., Balazinska, M., & Ernst, M. D. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920881 · Cited by 693
Logistic Regression, AdaBoost and Bregman Distances
Collins, M., Schapire, R. E., & Singer, Y. (2002) · Machine Learning · doi:10.1023/a:1013912006537 · Cited by 687
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.14 · Cited by 628
GPS: a graph processing system
Salihoglu, S., & Widom, J. (2013) · Proceedings of the 25th International Conference on Scientific and Statistical Database Management · doi:10.1145/2484838.2484843 · Cited by 510
WTF: the who to follow service at Twitter
Gupta, P., Goel, A., Lin, J., Sharma, A., Wang, D., & Zadeh, R. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488433 · Cited by 461
Scalable SPARQL querying of large RDF graphs
Huang, J., Abadi, D. J., & Ren, K. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402747 · Cited by 461
Trinity: a distributed graph engine on a memory cloud
Shao, B., Wang, H., & Li, Y. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2467799 · Cited by 432
Piccolo: building fast, distributed programs with partitioned tables
Power, R., & Li, J. (2010) · doi:10.5555/1924943.1924964 · Cited by 252
Balanced label propagation for partitioning massive graphs
Ugander, J., & Backstrom, L. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433461 · Cited by 170
Asynchronous Large-Scale Graph Processing Made Easy
Wang, G., Xie, W., Demers, A. J., & Gehrke, J. E. (2013) · Cited by 142
Signal/Collect: Graph Algorithms for the (Semantic) Web
Stutz, P., Bernstein, A., & Cohen, W. W. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17746-0_48 · Cited by 125
A comparison of platforms for implementing and running very large scale machine learning algorithms
Cai, Z., Gao, Z. J., Luo, S., Perez, L. L., Vagena, Z., & Jermaine, C. (2014) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2588555.2593680 · Cited by 51
Cited by
Intelligent Computing: The Latest Advances, Challenges, and Future
Zhu, S., Yu, T., Xu, T., Chen, H., Dustdar, S., Gigan, S., Gunduz, D., Hossain, E., Jin, Y., Lin, F., et al. (2023) · Intelligent Computing · doi:10.34133/icomputing.0006 · Cited by 290
PyTorch-BigGraph: A Large-scale Graph Embedding System
Lerer, A., Wu, L., Shen, J., Lacroix, T., Wehrstedt, L., Bose, A., & Peysakhovich, A. (2019) · arXiv · doi:10.48550/arxiv.1903.12287 · Cited by 247
neuPrint: an open access tool for EM connectomics
Plaza, S. M., Clements, J., Dolafi, T., Umayam, L., Neubarth, N. N., Scheffer, L. K., & Berg, S. (2022) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2022.896292 · Cited by 145
Metadata
- Authors
- Ching, A., Edunov, S., Kabiljo, M., Logothetis, D., & Muthukrishnan, S.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2015-08
- Volume
- 8
- Issue
- 12
- Pages
- 1804-1815
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2296407087
- Cited by
- 404
- References
- 29
- FWCI
- 42.75
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.