Trinity: A distributed graph engine on a memory cloud

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2013, Pages 505-516

  Shao, Bin ^a   Wang, Haixun ^a   Li, Yatao ^b  

^a MICROSOFT RESEARCH ASIA   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Distributed System; Graph Database; Memory Cloud

Indexed keywords

DISTRIBUTED MEMORY; DISTRIBUTED SYSTEMS; GRAPH DATABASE; HIGH LEVEL SPECIFICATION; MEMORY CLOUDS; MEMORY-BASED APPROACH; NETWORK COMMUNICATIONS; OFF-LINE COMPUTATION;

OPTIMIZATION; PARALLEL ARCHITECTURES; SPECIFICATION LANGUAGES;

ENGINES;

EID: 84880550300     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463676.2467799     Document Type: Conference Paper

References (37)

1. http://graphlab.org/.
2. http://hadoop.apache.org/.
3. http://incubator.apache.org/giraph/.
4. http://neo4j.org/.
5. http://www.graph500.org/.
6. How to partition a billion-scale graph. Technical report, Microsoft Research, 2012.
7. M. K. Aguilera, A. Merchant, M. Shah, A. Veitch, and C. Karamanolis. Sinfonia: a new paradigm for building scalable distributed systems. SOSP '07, pages 159-174, 2007.
8. D. G. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan. Fawn: a fast array of wimpy nodes. SOSP '09, pages 1-14.
9. J. Berry, B. Hendrickson, S. Kahan, and P. Konecny. Software and algorithms for graph queries on multithreaded architectures. In IPDPS 2007, pages 1-14, 2007.
10. D. Borthakur. The Hadoop Distributed File System: Architecture and Design, 2007.
11. R. Bramandia, B. Choi, and W. K. Ng. Incremental maintenance of 2-hop labeling of large graphs. TKDE, 22(5):682-698, 2010.
12. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. SDM '04, 2004.
13. T. D. Chandra, R. Griesemer, and J. Redstone. Paxos made live: an engineering perspective. PODC '07, pages 398-407, 2007.
14. J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang. Fast graph pattern matching. In ICDE, pages 913-922, 2008.
15. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. OSDI '04, pages 137-150.
16. E. W. Dijkstra. Shmuel Safra's version of termination detection. Jan. 1987.
17. B. Fitzpatrick. Distributed caching with memcached. Linux J., August 2004.
18. J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI, pages 17-30, 2012.
19. D. Gregor and A. Lumsdaine. The Parallel BGL: A generic library for distributed graph computations. POOSC '05.
20. Y. Guo, Z. Pan, and J. Heflin. LUBM: A benchmark for OWL knowledge base systems. Journal of Web Semantics, 3(2-3):158-182, 2005.
21. H. Higaki, K. Shima, T. Tachikawa, and M. Takizawa. Checkpoint and rollback in asynchronous distributed systems. INFOCOM '97, pages 998-, 1997.
22. B. Iordanov. Hypergraphdb: a generalized graph database. WAIM '10, pages 25-36, 2010.
23. U. Kang, C. E. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining system implementation and observations. ICDM '09, pages 229-238, 2009.
24. G. Karypis and V. Kumar. Parallel multilevel k-way partitioning scheme for irregular graphs. Supercomputing '96.
25. A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a pc. In OSDI, pages 31-46, 2012.
26. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. W. Berry. Challenges in parallel graph processing. Parallel Processing Letters, 17(1):5-20, 2007.
27. N. A. Lynch. Distributed Algorithms. 1996.
28. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. SIGMOD '10.
29. D. Ongaro, S. M. Rumble, R. Stutsman, J. Ousterhout, and M. Rosenblum. Fast crash recovery in ramcloud. SOSP '11, pages 29-41, 2011.
30. J. Ousterhout, P. Agrawal, D. Erickson, C. Kozyrakis, J. Leverich, D. Mazières, S. Mitra, A. Narayanan, G. Parulkar, M. Rosenblum, S. M. Rumble, E. Stratmann, and R. Stutsman. The case for ramclouds: scalable high-performance storage entirely in dram. SIGOPS Oper. Syst. Rev., 43:92-105, 2010.
31. T. Schütt, F. Schintke, and A. Reinefeld. Scalaris: reliable transactional p2p key/value store. ERLANG '08, pages 41-48, 2008.
32. Z. Sun, H. Wang, H. Wang, B. Shao, and J. Li. Efficient subgraph matching on billion node graphs. Proc. VLDB Endow., 5(9):788-799, May 2012.
33. W. Wu, H. Li, H. Wang, and K. Zhu. Probase: A probabilistic taxonomy for text understanding. In SIGMOD, 2012.
34. M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica. Spark: cluster computing with working sets. HotCloud'10, pages 10-10, 2010.
35. J. Zawodny. Redis: Lightweight key/value store that goes the extra mile. Linux Magazine, 2009.
36. K. Zeng, J. Yang, H. Wang, B. Shao, and Z. Wang. A distributed graph engine for web scale RDF data. In VLDB 2013.
37. X. Zhao, A. Sala, C. Wilson, H. Zheng, and B. Y. Zhao. Orion: shortest path estimation for large social graphs. WOSN'10, pages 9-9, 2010.