{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:59:36Z","timestamp":1775638776785,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,9]],"date-time":"2017-05-09T00:00:00Z","timestamp":1494288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DHS Award","award":["HSHQDC-16-3-00083"],"award-info":[{"award-number":["HSHQDC-16-3-00083"]}]},{"name":"NSF CISE Expeditions Award","award":["CCF-1139158"],"award-info":[{"award-number":["CCF-1139158"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,9]]},"DOI":"10.1145\/3035918.3064012","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"1149-1164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["ZipG"],"prefix":"10.1145","author":[{"given":"Anurag","family":"Khandelwal","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongheng","family":"Yang","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evan","family":"Ye","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachit","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Stoica","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Breadth First Search. https:\/\/en.wikipedia.org\/wiki\/Breadth-first_search.  Breadth First Search. https:\/\/en.wikipedia.org\/wiki\/Breadth-first_search."},{"key":"e_1_3_2_1_2_1","unstructured":"Building a follower model from scratch. https:\/\/engineering.pinterest.com\/blog\/building-follower-model-scratch.  Building a follower model from scratch. https:\/\/engineering.pinterest.com\/blog\/building-follower-model-scratch."},{"key":"e_1_3_2_1_3_1","unstructured":"Demining the \"Join Bomb\" with graph queries. http:\/\/neo4j.com\/blog\/demining-the-join-bomb-with-graph-queries\/.  Demining the \"Join Bomb\" with graph queries. http:\/\/neo4j.com\/blog\/demining-the-join-bomb-with-graph-queries\/."},{"key":"e_1_3_2_1_4_1","unstructured":"FlockDB. https:\/\/github.com\/twitter\/flockdb.  FlockDB. https:\/\/github.com\/twitter\/flockdb."},{"key":"e_1_3_2_1_5_1","unstructured":"Function Shipping: Separating Logical and Physical Tiers. https:\/\/docs.oracle.com\/cd\/A87860_01\/doc\/appdev.817\/a86030\/adx16nt4.htm.  Function Shipping: Separating Logical and Physical Tiers. https:\/\/docs.oracle.com\/cd\/A87860_01\/doc\/appdev.817\/a86030\/adx16nt4.htm."},{"key":"e_1_3_2_1_6_1","unstructured":"gMark Queries for LDBC Social Network Benchmark. https:\/\/github.com\/graphMark\/gmark\/tree\/master\/demo\/social\/social-translated.  gMark Queries for LDBC Social Network Benchmark. https:\/\/github.com\/graphMark\/gmark\/tree\/master\/demo\/social\/social-translated."},{"key":"e_1_3_2_1_7_1","unstructured":"Introducing FlockDB. https:\/\/blog.twitter.com\/2010\/introducing-flockdb.  Introducing FlockDB. https:\/\/blog.twitter.com\/2010\/introducing-flockdb."},{"key":"e_1_3_2_1_8_1","unstructured":"Introducing Graph Search Beta. http:\/\/newsroom.fb.com\/news\/2013\/01\/introducing-graph-search-beta\/.  Introducing Graph Search Beta. http:\/\/newsroom.fb.com\/news\/2013\/01\/introducing-graph-search-beta\/."},{"key":"e_1_3_2_1_9_1","unstructured":"LinkBench. https:\/\/github.com\/facebookarchive\/linkbench.  LinkBench. https:\/\/github.com\/facebookarchive\/linkbench."},{"key":"e_1_3_2_1_10_1","unstructured":"Microsoft GraphView. https:\/\/github.com\/facebookarchive\/linkbench.  Microsoft GraphView. https:\/\/github.com\/facebookarchive\/linkbench."},{"key":"e_1_3_2_1_11_1","unstructured":"Neo4j. http:\/\/neo4j.com\/.  Neo4j. http:\/\/neo4j.com\/."},{"key":"e_1_3_2_1_12_1","unstructured":"Neo4j Pushes Graph DB Limits Past a Quadrillion Nodes. https:\/\/www.datanami.com\/2016\/04\/26\/neo4j-pushes-graph-db-limits-past-quadrillion-nodes\/.  Neo4j Pushes Graph DB Limits Past a Quadrillion Nodes. https:\/\/www.datanami.com\/2016\/04\/26\/neo4j-pushes-graph-db-limits-past-quadrillion-nodes\/."},{"key":"e_1_3_2_1_13_1","unstructured":"openCypher. http:\/\/www.opencypher.org.  openCypher. http:\/\/www.opencypher.org."},{"key":"e_1_3_2_1_14_1","unstructured":"OrientDB. http:\/\/orientdb.com\/.  OrientDB. http:\/\/orientdb.com\/."},{"key":"e_1_3_2_1_15_1","unstructured":"Property Graph Model. https:\/\/github.com\/tinkerpop\/blueprints\/wiki\/Property-Graph-Model.  Property Graph Model. https:\/\/github.com\/tinkerpop\/blueprints\/wiki\/Property-Graph-Model."},{"key":"e_1_3_2_1_16_1","unstructured":"Sparksee by Sparsity Technologies. http:\/\/www.sparsity-technologies.com.  Sparksee by Sparsity Technologies. http:\/\/www.sparsity-technologies.com."},{"key":"e_1_3_2_1_17_1","unstructured":"Suffix Array. http:\/\/en.wikipedia.org\/wiki\/Suffix_array.  Suffix Array. http:\/\/en.wikipedia.org\/wiki\/Suffix_array."},{"key":"e_1_3_2_1_18_1","unstructured":"Titan. http:\/\/thinkaurelius.github.io\/titan\/.  Titan. http:\/\/thinkaurelius.github.io\/titan\/."},{"key":"e_1_3_2_1_19_1","unstructured":"Titan Data Model. http:\/\/s3.thinkaurelius.com\/docs\/titan\/current\/data-model.html.  Titan Data Model. http:\/\/s3.thinkaurelius.com\/docs\/titan\/current\/data-model.html."},{"key":"e_1_3_2_1_20_1","unstructured":"Virtuoso Universal Server. http:\/\/virtuoso.openlinksw.com.  Virtuoso Universal Server. http:\/\/virtuoso.openlinksw.com."},{"key":"e_1_3_2_1_21_1","volume-title":"Succinct: Enabling Queries on Compressed Data. In USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Agarwal R.","year":"2015","unstructured":"R. Agarwal , A. Khandelwal , and I. Stoica . Succinct: Enabling Queries on Compressed Data. In USENIX Symposium on Networked Systems Design and Implementation (NSDI) , 2015 . R. Agarwal, A. Khandelwal, and I. Stoica. Succinct: Enabling Queries on Compressed Data. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2015."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488393"},{"key":"e_1_3_2_1_23_1","volume-title":"NSDI","author":"Anand A.","year":"2010","unstructured":"A. Anand , C. Muthukrishnan , S. Kappes , A. Akella , and S. Nath . Cheap and large cams for high performance data-intensive networked systems . In NSDI , 2010 . A. Anand, C. Muthukrishnan, S. Kappes, A. Akella, and S. Nath. Cheap and large cams for high performance data-intensive networked systems. In NSDI, 2010."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007283"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465216"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)80047-0"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_29_1","volume-title":"USENIX Annual Technical Conference (ATC)","author":"Bronson N.","year":"2013","unstructured":"N. Bronson , Z. Amsden , G. Cabrera , P. Chakka , P. Dimov , H. Ding , J. Ferris , A. Giardullo , S. Kulkarni , H. Li , : Facebook\\textquoterights Distributed Data Store for the Social Graph . In USENIX Annual Technical Conference (ATC) , 2013 . N. Bronson, Z. Amsden, G. Cabrera, P. Chakka, P. Dimov, H. Ding, J. Ferris, A. Giardullo, S. Kulkarni, H. Li, et al. TAO: Facebook\\textquoterights Distributed Data Store for the Social Graph. In USENIX Annual Technical Conference (ATC), 2013."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303996"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38749"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2983200.2983202"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213855"},{"key":"e_1_3_2_1_38_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Gonzalez J. E.","year":"2014","unstructured":"J. E. Gonzalez , R. S. Xin , A. Dave , D. Crankshaw , M. J. Franklin , and I. Stoica . GraphX: Graph Processing in a Distributed Dataflow Framework . In USENIX Symposium on Operating Systems Design and Implementation (OSDI) , 2014 . J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica. GraphX: Graph Processing in a Distributed Dataflow Framework. In USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2014."},{"key":"e_1_3_2_1_39_1","volume-title":"ACM Workshop on Social Network mining and Analysis (SNAKDD)","author":"Hern\u00e1ndez C.","year":"2011","unstructured":"C. Hern\u00e1ndez and G. Navarro . Compression of Web and Social Graphs supporting Neighbor and Community Queries . In ACM Workshop on Social Network mining and Analysis (SNAKDD) , 2011 . C. Hern\u00e1ndez and G. Navarro. Compression of Web and Social Graphs supporting Neighbor and Community Queries. In ACM Workshop on Social Network mining and Analysis (SNAKDD), 2011."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0648-4"},{"key":"e_1_3_2_1_41_1","unstructured":"Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data 2014.  Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data 2014."},{"key":"e_1_3_2_1_42_1","volume-title":"BlowFish: Dynamic Storage-Performance Tradeoff in Data Stores. In USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Khandelwal A.","year":"2016","unstructured":"A. Khandelwal , R. Agarwal , and I. Stoica . BlowFish: Dynamic Storage-Performance Tradeoff in Data Stores. In USENIX Symposium on Networked Systems Design and Implementation (NSDI) , 2016 . A. Khandelwal, R. Agarwal, and I. Stoica. BlowFish: Dynamic Storage-Performance Tradeoff in Data Stores. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2016."},{"key":"e_1_3_2_1_43_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. E. Blelloch , and C. Guestrin . GraphChi: Large-Scale Graph Computation on Just a PC . In USENIX Symposium on Operating Systems Design and Implementation (OSDI) , 2012 . A. Kyrola, G. E. Blelloch, and C. Guestrin. GraphChi: Large-Scale Graph Computation on Just a PC. In USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2012."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_1_45_1","volume-title":"Preprint","author":"Lang K.","year":"2004","unstructured":"K. Lang . Finding good nearly balanced cuts in power law graphs . Preprint , 2004 . K. Lang. Finding good nearly balanced cuts in power law graphs. Preprint, 2004."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274585"},{"key":"e_1_3_2_1_48_1","volume-title":"GraphLab: A New Framework For Parallel Machine Learning. arXiv preprint arXiv:1408.2041","author":"Low Y.","year":"2014","unstructured":"Y. Low , J. E. Gonzalez , A. Kyrola , D. Bickson , C. E. Guestrin , and J. Hellerstein . GraphLab: A New Framework For Parallel Machine Learning. arXiv preprint arXiv:1408.2041 , 2014 . Y. Low, J. E. Gonzalez, A. Kyrola, D. Bickson, C. E. Guestrin, and J. Hellerstein. GraphLab: A New Framework For Parallel Machine Learning. arXiv preprint arXiv:1408.2041, 2014."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939856"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2011.5767616"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835873"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/263109.263162"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_56_1","unstructured":"J. Shun L. Dhulipala and G. Blelloch. Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra  J. Shun L. Dhulipala and G. Blelloch. Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra"},{"key":"e_1_3_2_1_57_1","volume-title":"IEEE Data Compression Conference (DCC)","year":"2015","unstructured":". In IEEE Data Compression Conference (DCC) , 2015 . . In IEEE Data Compression Conference (DCC), 2015."},{"key":"e_1_3_2_1_58_1","volume-title":"RPC Chains: Efficient Client-server Communication in Geodistributed Systems. In USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Song Y. J.","year":"2009","unstructured":"Y. J. Song , M. K. Aguilera , R. Kotla , and D. Malkhi . RPC Chains: Efficient Client-server Communication in Geodistributed Systems. In USENIX Symposium on Networked Systems Design and Implementation (NSDI) , 2009 . Y. J. Song, M. K. Aguilera, R. Kotla, and D. Malkhi. RPC Chains: Efficient Client-server Communication in Geodistributed Systems. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2009."},{"key":"e_1_3_2_1_59_1","volume-title":"Workshop on Hot Topics in Cloud Computing (HotCloud)","author":"Wang R.","year":"2013","unstructured":"R. Wang , C. Conrad , and S. Shah . Using Set Cover to Optimize a Large-Scale Low Latency Distributed Graph . In Workshop on Hot Topics in Cloud Computing (HotCloud) , 2013 . R. Wang, C. Conrad, and S. Shah. Using Set Cover to Optimize a Large-Scale Low Latency Distributed Graph. In Workshop on Hot Topics in Cloud Computing (HotCloud), 2013."}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","location":"Chicago Illinois USA","acronym":"SIGMOD\/PODS'17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2017 ACM International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3064012","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3064012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:41Z","timestamp":1750217801000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3064012"}},"subtitle":["A Memory-efficient Graph Store for Interactive Queries"],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":59,"alternative-id":["10.1145\/3035918.3064012","10.1145\/3035918"],"URL":"https:\/\/doi.org\/10.1145\/3035918.3064012","relation":{},"subject":[],"published":{"date-parts":[[2017,5,9]]},"assertion":[{"value":"2017-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}