{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:21:22Z","timestamp":1778278882974,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,10]],"date-time":"2018-06-10T00:00:00Z","timestamp":1528588800000},"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":[[2018,6,10]]},"DOI":"10.1145\/3210259.3210269","type":"proceedings-article","created":{"date-parts":[[2018,6,5]],"date-time":"2018-06-05T17:54:00Z","timestamp":1528221240000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Bridging the GAP"],"prefix":"10.1145","author":[{"given":"Anand Padmanabha","family":"Iyer","sequence":"first","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aurojit","family":"Panda","sequence":"additional","affiliation":[{"name":"NYU"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivaram","family":"Venkataraman","sequence":"additional","affiliation":[{"name":"University of Wisconsin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mosharaf","family":"Chowdhury","sequence":"additional","affiliation":[{"name":"University of Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Akella","sequence":"additional","affiliation":[{"name":"University of Wisconsin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Stoica","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"{n. d.}. Graph DBMS increased their popularity by 500% within the last 2 years. http:\/\/db-engines.eom\/en\/blog_post\/\/43. ({n. d.})."},{"key":"e_1_3_2_1_2_1","unstructured":"{n. d.}. Graph500 Benchmarks. http:\/\/www.graph500.org. ({n. d.})."},{"key":"e_1_3_2_1_3_1","unstructured":"{n. d.}. Stanford Large Network Dataset Collection. https:\/\/snap.stanford.edu\/. ({n. d.})."},{"key":"e_1_3_2_1_4_1","unstructured":"2016. Graph Data Use-eases. https:\/\/neo4j.com\/resourees\/2016-state-of-the-graph\/. (2016)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465355"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2616448.2616475"},{"key":"e_1_3_2_1_7_1","unstructured":"Apache Giraph. {n. d.}. http:\/\/giraph.apache.org. ({n. d.})."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2015.12"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390021.2390023"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168846"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694351"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685096"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2387880.2387883"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592799"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789770.2789792"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2387880.2387884"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3023549.3023589"},{"key":"e_1_3_2_1_22_1","volume-title":"2015 IEEE 31st International Conference on Data Engineering. 363--374","author":"Macko P.","unstructured":"P. Macko, V.J. Marathe, D. W. Margo, and M. I. Seltzer. 2015. LLAMA: Efficient graph analytics using Large Multiversioned Arrays. In 2015 IEEE 31st International Conference on Data Engineering. 363--374."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_24_1","unstructured":"Microsoft Naiad Team. 2014. GraphLINQ: A graph library for Naiad. http:\/\/bigdataatsvc.wordpress.com\/2014\/05\/08\/graphlinq-a-graph-library-for-naiad\/. (2014)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960419"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0405-2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_30_1","volume-title":"Spielman and Shang-Hua Teng","author":"Daniel","year":"2008","unstructured":"Daniel A. Spielman and Shang-Hua Teng. 2008. Spectral Sparsification of Graphs. CoRR abs\/0808.4134 (2008). http:\/\/arxiv.org\/abs\/0808.4134"},{"key":"e_1_3_2_1_31_1","unstructured":"Guozhang Wang Wenlei Xie Alan J Demers and Johannes Gehrke. 2013. Asynchronous Large-Scale Graph Processing Made Easy.. In CIDR."}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston Texas","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210259.3210269","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210259.3210269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:49Z","timestamp":1750210789000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210259.3210269"}},"subtitle":["towards approximate graph analytics"],"short-title":[],"issued":{"date-parts":[[2018,6,10]]},"references-count":31,"alternative-id":["10.1145\/3210259.3210269","10.1145\/3210259"],"URL":"https:\/\/doi.org\/10.1145\/3210259.3210269","relation":{},"subject":[],"published":{"date-parts":[[2018,6,10]]},"assertion":[{"value":"2018-06-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}