The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Trinity: a distributed graph engine on a memory cloud
Abstract
Computations performed by graph algorithms are data driven, and require a high degree of random data access. Despite the great progresses made in disk technology, it still cannot provide the level of efficient random access required by graph computation. On the other hand, memory-based approaches usually do not scale due to the capacity limit of single machines. In this paper, we introduce Trinity, a general purpose graph engine over a distributed memory cloud. Through optimized memory management and network communication, Trinity supports fast graph exploration as well as efficient parallel computing. In particular, Trinity leverages graph access patterns in both online and offline computation to optimize memory and communication for best performance. These enable Trinity to support efficient online query processing and offline analytics on large graphs with just a few commodity machines. Furthermore, Trinity provides a high level specification language called TSL for users to declare data schema and communication protocols, which brings great ease-of-use for general purpose graph management and computing. Our experiments show Trinity's performance in both low latency graph queries as well as high throughput graph analytics on web-scale, billion-node graphs.
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 Hadoop Distributed File System
Shvachko, K., Kuang, H., Radia, S., & Chansler, R. (2010) · 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) · doi:10.1109/msst.2010.5496972 · Cited by 4,834
(2010) · Cited by 4,411
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
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
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61769-8 · Cited by 1,865
LUBM: A benchmark for OWL knowledge base systems
Guo, Y., Pan, Z., & Heflin, J. (2005) · Journal of Web Semantics · doi:10.1016/j.websem.2005.06.005 · Cited by 1,584
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
R-MAT: A Recursive Model for Graph Mining
Chakrabarti, D., Zhan, Y., & Faloutsos, C. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.43 · Cited by 1,255
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
Probase: a probabilistic taxonomy for text understanding
Wu, W., Li, H., Wang, H., & Zhu, K. Q. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213891 · Cited by 763
Self-citationPEGASUS: 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
Paxos made live: an engineering perspective
Chandra, T. D., Griesemer, R., & Redstone, J. (2007) · Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing · doi:10.1145/1281100.1281103 · Cited by 619
FAWN: a fast array of wimpy nodes
Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629577 · Cited by 561
CHALLENGES IN PARALLEL GRAPH PROCESSING
LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J. (2007) · Parallel Processing Letters · doi:10.1142/s0129626407002843 · Cited by 469
The case for RAMClouds: scalable high-performance storage entirely in DRAM
Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazières, D., Mitra, S., Narayanan, A., Parulkar, G., Rosenblum, M., et al. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1713254.1713276 · Cited by 447
Distributed caching with memcached
FitzpatrickBrad (2004) · Linux journal · doi:10.5555/1012889.1012894 · Cited by 388
Fast crash recovery in RAMCloud
Ongaro, D., Rumble, S. M., Stutsman, R., Ousterhout, J., & Rosenblum, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043560 · Cited by 360
Lynch, N. (1996) · Cited by 354
A distributed graph engine for web scale RDF data
Zeng, K., Yang, J., Wang, H., Shao, B., & Wang, Z. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2535570.2488333 · Cited by 314
Self-citationParallel multilevel k-way partitioning scheme for irregular graphs
Karypis, G., & Kumar, V. (1996) · Proceedings of the 1996 ACM/IEEE conference on Supercomputing · doi:10.1145/369028.369103 · Cited by 310
Cheng, J., Yu, J. X., Ding, B., Yu, P. S., & Wang, H. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497500 · Cited by 164
Self-citationHyperGraphDB: A Generalized Graph Database
Iordanov, B. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16720-1_3 · Cited by 143
Scalaris: reliable transactional p2p key/value store
Schütt, T., Schintke, F., & Reinefeld, A. (2008) · ACM SIGPLAN Workshop on Erlang (Erlang) · doi:10.1145/1411273.1411280 · Cited by 101
Orion: shortest path estimation for large social graphs
Zhao, X., Sala, A., Wilson, C., Zheng, H.-T., & Zhao, B. Y. (2010) · Cited by 53
Incremental Maintenance of 2-Hop Labeling of Large Graphs
Bramandia, R., Choi, B. K. K., & Ng, W. K. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.117 · Cited by 49
Cited by
In-Memory Big Data Management and Processing: A Survey
Zhang, H., Chen, G., Ooi, B. C., Tan, K.-L., & Zhang, M. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2427795 · Cited by 414
One trillion edges: graph processing at Facebook-scale
Ching, A., Edunov, S., Kabiljo, M., Logothetis, D., & Muthukrishnan, S. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2824032.2824077 · Cited by 404
A Comprehensive Survey on Automatic Knowledge Graph Construction
Zhong, L., Wu, J., Li, Q., Peng, H., & Wu, X. (2024) · ACM Computing Surveys · doi:10.1145/3618295 · Cited by 382
From "think like a vertex" to "think like a graph"
Tian, Y., Balmin, A., Corsten, S. A., Tatikonda, S., & McPherson, J. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2732232.2732238 · Cited by 352
A distributed graph engine for web scale RDF data
Zeng, K., Yang, J., Wang, H., Shao, B., & Wang, Z. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2535570.2488333 · Cited by 314
Self-citation
Metadata
- Authors
- Shao, B., Wang, H., & Li, Y.
- Venue
- Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
- Publisher
- ACM
- Published
- 2013-06-22
- Pages
- 505-516
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2160459668
- Cited by
- 432
- References
- 26
- FWCI
- 44.59
- Type
- conference paper
- 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.