{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:55:36Z","timestamp":1771700136436,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,22]]},"DOI":"10.1145\/2463676.2467799","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"505-516","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":301,"title":["Trinity"],"prefix":"10.1145","author":[{"given":"Bin","family":"Shao","sequence":"first","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Haixun","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Yatao","family":"Li","sequence":"additional","affiliation":[{"name":"HKUST, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"http:\/\/graphlab.org\/.  http:\/\/graphlab.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"http:\/\/hadoop.apache.org\/.  http:\/\/hadoop.apache.org\/."},{"key":"e_1_3_2_1_3_1","unstructured":"http:\/\/incubator.apache.org\/giraph\/.  http:\/\/incubator.apache.org\/giraph\/."},{"key":"e_1_3_2_1_4_1","unstructured":"http:\/\/neo4j.org\/.  http:\/\/neo4j.org\/."},{"key":"e_1_3_2_1_5_1","unstructured":"http:\/\/www.graph500.org\/.  http:\/\/www.graph500.org\/."},{"key":"e_1_3_2_1_6_1","volume-title":"Microsoft Research","year":"2012","unstructured":"How to partition a billion-scale graph. Technical report , Microsoft Research , 2012 . How to partition a billion-scale graph. Technical report, Microsoft Research, 2012."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294278"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629577"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370685"},{"key":"e_1_3_2_1_10_1","volume-title":"The Hadoop Distributed File System: Architecture and Design","author":"Borthakur D.","year":"2007","unstructured":"D. Borthakur . The Hadoop Distributed File System: Architecture and Design , 2007 . D. Borthakur. The Hadoop Distributed File System: Architecture and Design, 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.117"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281103"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"e_1_3_2_1_15_1","first-page":"137","volume-title":"OSDI '04","author":"Dean J.","unstructured":"J. Dean and S. Ghemawat . Mapreduce: Simplified data processing on large clusters . OSDI '04 , pages 137 -- 150 . J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. OSDI '04, pages 137--150."},{"key":"e_1_3_2_1_16_1","volume-title":"Shmuel Safra's version of termination detection","author":"Dijkstra E. W.","year":"1987","unstructured":"E. W. Dijkstra . Shmuel Safra's version of termination detection . Jan. 1987 . E. W. Dijkstra. Shmuel Safra's version of termination detection. Jan. 1987."},{"key":"e_1_3_2_1_17_1","article-title":"Distributed caching with memcached","author":"Fitzpatrick B.","year":"2004","unstructured":"B. Fitzpatrick . Distributed caching with memcached . Linux J. , August 2004 . B. Fitzpatrick. Distributed caching with memcached. Linux J., August 2004.","journal-title":"Linux J."},{"key":"e_1_3_2_1_18_1","first-page":"17","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2012","unstructured":"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 . 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."},{"key":"e_1_3_2_1_19_1","volume-title":"POOSC '05","author":"Gregor D.","unstructured":"D. Gregor and A. Lumsdaine . The Parallel BGL: A generic library for distributed graph computations . POOSC '05 . D. Gregor and A. Lumsdaine. The Parallel BGL: A generic library for distributed graph computations. POOSC '05."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"e_1_3_2_1_21_1","first-page":"998","volume-title":"INFOCOM '97","author":"Higaki H.","unstructured":"H. Higaki , K. Shima , T. Tachikawa , and M. Takizawa . Checkpoint and rollback in asynchronous distributed systems . INFOCOM '97 , pages 998 --, 1997. H. Higaki, K. Shima, T. Tachikawa, and M. Takizawa. Checkpoint and rollback in asynchronous distributed systems. INFOCOM '97, pages 998--, 1997."},{"key":"e_1_3_2_1_22_1","first-page":"25","volume-title":"WAIM '10","author":"Iordanov. Hypergraphdb B.","year":"2010","unstructured":"B. Iordanov. Hypergraphdb : a generalized graph database . WAIM '10 , pages 25 -- 36 , 2010 . B. Iordanov. Hypergraphdb: a generalized graph database. WAIM '10, pages 25--36, 2010."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369103"},{"key":"e_1_3_2_1_25_1","first-page":"31","volume-title":"OSDI","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . Graphchi: Large-scale graph computation on just a pc . In OSDI , pages 31 -- 46 , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a pc. In OSDI, pages 31--46, 2012."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_27_1","volume-title":"Distributed Algorithms","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch . Distributed Algorithms . 1996 . N. A. Lynch. Distributed Algorithms. 1996."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043560"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1713254.1713276"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411273.1411280"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213891"},{"key":"e_1_3_2_1_34_1","first-page":"10","volume-title":"HotCloud'10","author":"Zaharia M.","year":"2010","unstructured":"M. Zaharia , M. Chowdhury , M. J. Franklin , S. Shenker , and I. Stoica . Spark: cluster computing with working sets . HotCloud'10 , pages 10 -- 10 , 2010 . M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica. Spark: cluster computing with working sets. HotCloud'10, pages 10--10, 2010."},{"key":"e_1_3_2_1_35_1","volume-title":"Linux Magazine","author":"Zawodny J.","year":"2009","unstructured":"J. Zawodny . Redis : Lightweight key\/value store that goes the extra mile . Linux Magazine , 2009 . J. Zawodny. Redis: Lightweight key\/value store that goes the extra mile. Linux Magazine, 2009."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488333"},{"key":"e_1_3_2_1_37_1","first-page":"9","volume-title":"WOSN'10","author":"Zhao X.","year":"2010","unstructured":"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 . 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."}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York USA","acronym":"SIGMOD\/PODS'13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2467799","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2467799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:16Z","timestamp":1750238476000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2467799"}},"subtitle":["a distributed graph engine on a memory cloud"],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":37,"alternative-id":["10.1145\/2463676.2467799","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2467799","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}