From "Think Like a Vertex" to "Think Like a Graph"
Summary: Shifts from vertex-centric to graph-centric thinking by exposing partition structure, enabling intra-partition computation. Giraph++ atop Apache Giraph yields 63× faster connected components and 204× fewer messages on a 118M-vertex web graph. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yuanyuan Tian (IBM)
- 2. Andrey Balmin (GraphSQL)
- 3. Severin Andreas Corsten (IBM)
- 4. Shirish Tatikonda (IBM)
- 5. John McPherson (IBM)
BibTeX Citation
@article{tian_vldb14,
title = {{From "Think Like a Vertex" to "Think Like a Graph"}},
author = {Tian, Yuanyuan and Balmin, Andrey and Corsten, Severin Andreas and Tatikonda, Shirish and McPherson, John},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {3},
pages = {193--204},
doi = {10.14778/2732232.2732238},
url = {https://doi.org/10.14778/2732232.2732238},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 42 of 42 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012092602 |
| 22 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00055962491 |
| 290 | ObjectRank: Authority-Based Keyword Search in Databases | 2004 | VLDB | 0.00021955068 |
| 442 | Differential dataflow | 2013 | CIDR | 0.00018210463 |
| 444 | Trinity: A Distributed Graph Engine on a Memory Cloud | 2013 | SIGMOD | 0.00018177351 |
| 497 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00017318153 |
| 511 | Scalable SPARQL Querying of Large RDF Graphs | 2011 | VLDB | 0.00017061883 |
| 1,187 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD | 0.00011606901 |
| 1,504 | Asynchronous Large-Scale Graph Processing Made Easy | 2013 | CIDR | 0.00010455083 |
| 1,840 | Towards Effective Partition Management for Large Graphs | 2012 | SIGMOD | 9.5291859e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,248 | Streaming Graph Partitioning: An Experimental Study | 2018 | VLDB |
| 2 | 4,285 | TurboGraph++: A Scalable and Fast Graph Analytics System | 2018 | SIGMOD |
| 3 | 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD |
| 4 | 394 | One Trillion Edges: Graph Processing at Facebook-Scale | 2015 | VLDB |
| 5 | 7,286 | Experimental Analysis of Distributed Graph Systems | 2018 | VLDB |
| 6 | 5,787 | MOCgraph: Scalable Distributed Graph Processing Using Message Online Computing | 2015 | VLDB |
| 7 | 2,372 | Giraph Unchained: Barrierless Asynchronous Parallel Execution in Pregel-like Graph Processing Systems | 2015 | VLDB |
| 8 | 1,310 | An Experimental Comparison of Pregel-like Graph Processing Systems | 2014 | VLDB |
| 9 | 2,338 | Optimizing Graph Algorithms on Pregel-like Systems | 2014 | VLDB |
| 10 | 1,862 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |