{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:14Z","timestamp":1775638454048,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1513679, CNS-1703936, CCF-1763514, CNS-1801884"],"award-info":[{"award-number":["CNS-1513679, CNS-1703936, CCF-1763514, CNS-1801884"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR001117C0047, HR0011-16-C-0056"],"award-info":[{"award-number":["HR001117C0047, HR0011-16-C-0056"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3299869.3300064","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"1411-1428","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Optimizing Declarative Graph Queries at Large Scale"],"prefix":"10.1145","author":[{"given":"Qizhen","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Akash","family":"Acharya","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Hongzhi","family":"Chen","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Simran","family":"Arora","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Ang","family":"Chen","sequence":"additional","affiliation":[{"name":"Rice University, Houston, TX, USA"}]},{"given":"Vincent","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Boon Thau","family":"Loo","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache Giraph. http:\/\/giraph.apache.org\/.  Apache Giraph. http:\/\/giraph.apache.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Apache Hive. https:\/\/hive.apache.org\/.  Apache Hive. https:\/\/hive.apache.org\/."},{"key":"e_1_3_2_1_3_1","unstructured":"BigDatalog. https:\/\/github.com\/ashkapsky\/BigDatalog.  BigDatalog. https:\/\/github.com\/ashkapsky\/BigDatalog."},{"key":"e_1_3_2_1_4_1","unstructured":"Lz4 - extremely fast compression. http:\/\/lz4.github.io\/lz4\/.  Lz4 - extremely fast compression. http:\/\/lz4.github.io\/lz4\/."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142548"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376712"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367892"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915213"},{"key":"e_1_3_2_1_9_1","volume-title":"USENIX ATC '14","author":"Ahmad F.","year":"2014","unstructured":"F. Ahmad and et al. ShuffleWatcher: Shuffle-aware scheduling in multi-tenant mapreduce clusters . In USENIX ATC '14 , 2014 . F. Ahmad and et al. ShuffleWatcher: Shuffle-aware scheduling in multi-tenant mapreduce clusters. In USENIX ATC '14, 2014."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_1_11_1","volume-title":"NSDI'17","author":"Alipourfard O.","year":"2017","unstructured":"O. Alipourfard and et al. Cherrypick: Adaptively unearthing the best cloud configurations for big data analytics . NSDI'17 , 2017 . O. Alipourfard and et al. Cherrypick: Adaptively unearthing the best cloud configurations for big data analytics. NSDI'17, 2017."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626316"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_3_2_1_14_1","volume-title":"Introducing data center fabric, the next-generation facebook data center network. https:\/\/goo.gl\/rE8wkL","author":"Andreyev A.","year":"2014","unstructured":"A. Andreyev . Introducing data center fabric, the next-generation facebook data center network. https:\/\/goo.gl\/rE8wkL , 2014 . Facebook . A. Andreyev. Introducing data center fabric, the next-generation facebook data center network. https:\/\/goo.gl\/rE8wkL, 2014. Facebook."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742797"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335420"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. SODA","author":"Blandford D. K.","year":"2003","unstructured":"D. K. Blandford , G. E. Blelloch , and I. A. Kash . Compact representations of separable graphs . In Proc. SODA , 2003 . D. K. Blandford, G. E. Blelloch, and I. A. Kash. Compact representations of separable graphs. In Proc. SODA, 2003."},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. ALENEX","author":"Blandford D. K.","year":"2004","unstructured":"D. K. Blandford , G. E. Blelloch , and I. A. Kash . An experimental analysis of a compact graph representation . In Proc. ALENEX , 2004 . D. K. Blandford, G. E. Blelloch, and I. A. Kash. An experimental analysis of a compact graph representation. In Proc. ALENEX, 2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735477"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018448"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2983200.2983203"},{"key":"e_1_3_2_1_23_1","volume-title":"August","author":"Systems Cisco","year":"2014","unstructured":"Cisco Systems . Data Center Design Summary , August 2014 . https:\/\/www.cisco.com\/c\/dam\/en\/us\/td\/docs\/solutions\/CVD\/Aug2014\/DataCenterDesignSummary-AUG14.pdf. Cisco Systems. Data Center Design Summary, August 2014. https:\/\/www.cisco.com\/c\/dam\/en\/us\/td\/docs\/solutions\/CVD\/Aug2014\/DataCenterDesignSummary-AUG14.pdf."},{"key":"e_1_3_2_1_24_1","volume-title":"NSDI '12","author":"Costa P.","year":"2012","unstructured":"P. Costa and et al. Camdoop: Exploiting in-network aggregation for big data applications . In NSDI '12 . USENIX, 2012 . P. Costa and et al. Camdoop: Exploiting in-network aggregation for big data applications. In NSDI '12. USENIX, 2012."},{"key":"e_1_3_2_1_25_1","volume-title":"OSDI'04","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . In OSDI'04 , San Francisco, CA , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI'04, San Francisco, CA, 2004."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1064"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018477"},{"key":"e_1_3_2_1_28_1","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez and et al. PowerGraph: Distributed graph-parallel computation on natural graphs . In OSDI , 2012 . J. E. Gonzalez and et al. PowerGraph: Distributed graph-parallel computation on natural graphs. In OSDI, 2012."},{"key":"e_1_3_2_1_29_1","volume-title":"OSDI","author":"Gonzalez J. E.","year":"2014","unstructured":"J. E. Gonzalez and et al. GraphX: Graph processing in a distributed dataflow framework . In OSDI , 2014 . J. E. Gonzalez and et al. GraphX: Graph processing in a distributed dataflow framework. In OSDI, 2014."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592576"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21909-7_3"},{"key":"e_1_3_2_1_32_1","volume-title":"Optimize data structures and memory access patterns to improve data locality. https:\/\/goo.gl\/xQ3ZGT","year":"2012","unstructured":"Intel. Optimize data structures and memory access patterns to improve data locality. https:\/\/goo.gl\/xQ3ZGT , 2012 . Intel . Intel. Optimize data structures and memory access patterns to improve data locality. https:\/\/goo.gl\/xQ3ZGT, 2012. Intel."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787488"},{"key":"e_1_3_2_1_34_1","unstructured":"M. Kabiljo and etal A comparison of state-of-the-art graph processing systems. https:\/\/code.facebook.com\/posts\/319004238457019\/a-comparison-of-state-of-the-art-graph-processing-systems\/.  M. Kabiljo and et al. A comparison of state-of-the-art graph processing systems. https:\/\/code.facebook.com\/posts\/319004238457019\/a-comparison-of-state-of-the-art-graph-processing-systems\/."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0283-9"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890968"},{"key":"e_1_3_2_1_37_1","first-page":"31","volume-title":"OSDI 2012","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. E. Blelloch , and C. Guestrin . GraphChi: Large-scale graph computation on just a PC . In OSDI 2012 , pages 31 -- 46 , 2012 . A. Kyrola, G. E. Blelloch, and C. Guestrin. GraphChi: Large-scale graph computation on just a PC. In OSDI 2012, pages 31--46, 2012."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544832"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/4492.4495"},{"key":"e_1_3_2_1_40_1","volume-title":"Slashburn: Graph compression and mining beyond caveman communities","author":"Lim Y.","year":"2014","unstructured":"Y. Lim , U. Kang , and C. Faloutsos . Slashburn: Graph compression and mining beyond caveman communities . IEEE TKDE , 2014 . Y. Lim, U. Kang, and C. Faloutsos. Slashburn: Graph compression and mining beyond caveman communities. IEEE TKDE, 2014."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836112"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142485"},{"key":"e_1_3_2_1_43_1","volume-title":"GraphLab: A new framework for parallel machine learning. UAI'10","author":"Low Y.","year":"2010","unstructured":"Y. Low and GraphLab: A new framework for parallel machine learning. UAI'10 . AUAI Press , 2010 . Y. Low and et al. GraphLab: A new framework for parallel machine learning. UAI'10. AUAI Press, 2010."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2259016.2259046"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_46_1","unstructured":"F. McSherry. Timely dataflow. https:\/\/github.com\/frankmcsherry\/timely-dataflow.  F. McSherry. Timely dataflow. https:\/\/github.com\/frankmcsherry\/timely-dataflow."},{"key":"e_1_3_2_1_47_1","volume-title":"HotOS '15","author":"McSherry F.","year":"2015","unstructured":"F. McSherry , M. Isard , and D. G. Murray . Scalability! but at what COST ? In HotOS '15 , 2015 . F. McSherry, M. Isard, and D. G. Murray. Scalability! but at what COST? In HotOS '15, 2015."},{"key":"e_1_3_2_1_48_1","volume-title":"Datalography: Scaling datalog graph analytics on graph processing systems","author":"Moustafa W. E.","year":"2016","unstructured":"W. E. Moustafa and Datalography: Scaling datalog graph analytics on graph processing systems . In IEEE BigData 2016 . W. E. Moustafa and et al. Datalography: Scaling datalog graph analytics on graph processing systems. In IEEE BigData 2016."},{"key":"e_1_3_2_1_49_1","unstructured":"Open Compute Project. Server\/SpecsAndDesigns June 2018. http:\/\/www.opencompute.org\/wiki\/Server\/SpecsAndDesigns.  Open Compute Project. Server\/SpecsAndDesigns June 2018. http:\/\/www.opencompute.org\/wiki\/Server\/SpecsAndDesigns."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556572"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915229"},{"key":"e_1_3_2_1_55_1","unstructured":"J. Shun and etal Smaller and faster: Parallel processing of compressed graphs with Ligra  J. Shun and et al. Smaller and faster: Parallel processing of compressed graphs with Ligra"},{"key":"e_1_3_2_1_56_1","volume-title":"Proc. Data Compression Conference","year":"2015","unstructured":". In Proc. Data Compression Conference , 2015 . . In Proc. Data Compression Conference, 2015."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787508"},{"key":"e_1_3_2_1_58_1","first-page":"501","volume-title":"VLDB '91","author":"Sudarshan S.","year":"1991","unstructured":"S. Sudarshan and R. Ramakrishnan . Aggregation and relevance in deductive databases . In VLDB '91 , pages 501 -- 511 , 1991 . S. Sudarshan and R. Ramakrishnan. Aggregation and relevance in deductive databases. In VLDB '91, pages 501--511, 1991."},{"key":"e_1_3_2_1_59_1","unstructured":"W. Vogels. https:\/\/twitter.com\/werner\/status\/25137574680.  W. Vogels. https:\/\/twitter.com\/werner\/status\/25137574680."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824052"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629600"},{"key":"e_1_3_2_1_62_1","unstructured":"Q. Zhang and etal Optimizing declarative graph queries at large scale (technical report). http:\/\/netdb.cis.upenn.edu\/papers\/graphrex_tr.pdf.  Q. Zhang and et al. Optimizing declarative graph queries at large scale (technical report). http:\/\/netdb.cis.upenn.edu\/papers\/graphrex_tr.pdf."},{"key":"e_1_3_2_1_63_1","volume-title":"NSDI '17","author":"Zhuo D.","year":"2017","unstructured":"D. Zhuo and et al. RAIL: A case for redundant arrays of inexpensive links in data center networks . In NSDI '17 , 2017 . D. Zhuo and et al. RAIL: A case for redundant arrays of inexpensive links in data center networks. In NSDI '17, 2017."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098849"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300064","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3300064","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3300064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:15Z","timestamp":1750210755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":64,"alternative-id":["10.1145\/3299869.3300064","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3300064","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}