{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:43:10Z","timestamp":1773193390022,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T00:00:00Z","timestamp":1491264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100008536","name":"Amazon Web Services","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008536","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1524852, CCF-1318103, CNS-1321179, CCF-1409829, CNS-1613023"],"award-info":[{"award-number":["CCF-1524852, CCF-1318103, CNS-1321179, CCF-1409829, CNS-1613023"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-14-1-0549, N00014-16-1-2913"],"award-info":[{"award-number":["N00014-14-1-0549, N00014-16-1-2913"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,4]]},"DOI":"10.1145\/3037697.3037748","type":"proceedings-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T08:47:40Z","timestamp":1491382060000},"page":"237-251","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":102,"title":["KickStarter"],"prefix":"10.1145","author":[{"given":"Keval","family":"Vora","sequence":"first","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]},{"given":"Guoqing","family":"Xu","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,4,4]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"277","volume-title":"CIDR","volume":"5","author":"Abadi D.J.","year":"2005","unstructured":"D.J. Abadi , Y. Ahmad , M. Balazinska , U. Cetintemel , M. Cherniack , J-H. Hwang , W. Lindner , A. Maskey , A. Rasin , E. Ryvkina , The design of the borealis stream processing engine . In CIDR , volume 5 , pages 277 -- 289 , 2005 . D.J. Abadi, Y. Ahmad, M. Balazinska, U. Cetintemel, M. Cherniack, J-H. Hwang, W. Lindner, A. Maskey, A. Rasin, E. Ryvkina, et al. The design of the borealis stream processing engine. In CIDR, volume 5, pages 277--289, 2005."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465272"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0133-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_6_1","volume-title":"Measuring user influence in twitter: The million follower fallacy. ICWSM, 10(10--17):30","author":"Cha M.","year":"2010","unstructured":"M. Cha , H. Haddadi , F. Benevenuto , and P.K. Gummadi . Measuring user influence in twitter: The million follower fallacy. ICWSM, 10(10--17):30 , 2010 . M. Cha, H. Haddadi, F. Benevenuto, and P.K. Gummadi. Measuring user influence in twitter: The million follower fallacy. ICWSM, 10(10--17):30, 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741970"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168846"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645373.1645376"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.326"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2010.5470687"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"e_1_3_2_1_13_1","unstructured":"Friendster network dataset 2015.  Friendster network dataset 2015."},{"key":"e_1_3_2_1_14_1","first-page":"599","volume-title":"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 OSDI , pages 599 -- 613 , 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 OSDI, pages 599--613, 2014."},{"key":"e_1_3_2_1_15_1","volume-title":"Stream: The stanford stream data manager","author":"STREAM Group et al.","year":"2003","unstructured":"STREAM Group et al. Stream: The stanford stream data manager . IEEE Data Engineering Bulletin , http:\/\/www-db. stanford. edu\/stream, 2(003), 2003 . STREAM Group et al. Stream: The stanford stream data manager. IEEE Data Engineering Bulletin, http:\/\/www-db. stanford. edu\/stream, 2(003), 2003."},{"key":"e_1_3_2_1_16_1","first-page":"1","volume-title":"EuroSys","author":"Han W.","year":"2014","unstructured":"W. Han , Y. Miao , K. Li , M. Wu , F. Yang , L. Zhou , V. Prabhakaran , W. Chen , and E. Chen . Chronos: A graph engine for temporal graph analysis . In EuroSys , pages 1: 1 -- 1 :14, 2014 . W. Han, Y. Miao, K. Li, M. Wu, F. Yang, L. Zhou, V. Prabhakaran, W. Chen, and E. Chen. Chronos: A graph engine for temporal graph analysis. In EuroSys, pages 1:1--1:14, 2014."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009268"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960419"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.71"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDBM.2007.34"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402713"},{"key":"e_1_3_2_1_26_1","series-title":"SIAM Parallel Processing for Scientific Computing","volume-title":"Scalable algorithms for analysis of massive, streaming graphs","author":"Riedy J.","year":"2012","unstructured":"J. Riedy and H. Meyerhenke . Scalable algorithms for analysis of massive, streaming graphs , In SIAM Parallel Processing for Scientific Computing , 2012 . J. Riedy and H. Meyerhenke. Scalable algorithms for analysis of massive, streaming graphs, In SIAM Parallel Processing for Scientific Computing, 2012."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/13093618X"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882950"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322235"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2580051"},{"key":"e_1_3_2_1_37_1","first-page":"147","volume-title":"SIGMOD","author":"Toshniwal A.","year":"2014","unstructured":"A. Toshniwal , S. Taneja , A. Shukla , K. Ramasamy , J.M Patel , S. Kulkarni , J. Jackson , K. Gade , M. Fu , J. Donham , Storm@ twitter . In SIGMOD , pages 147 -- 156 , 2014 . A. Toshniwal, S. Taneja, A. Shukla, K. Ramasamy, J.M Patel, S. Kulkarni, J. Jackson, K. Gade, M. Fu, J. Donham, et al. Storm@ twitter. In SIGMOD, pages 147--156, 2014."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_3_2_1_39_1","first-page":"507","volume-title":"USENIX ATC","author":"Vora K.","year":"2014","unstructured":"K. Vora , G. Xu , and R. Gupta . Load the edges you need: A generic I\/O optimization for disk-based graph processing . In USENIX ATC , pages 507 -- 522 , 2014 . K. Vora, G. Xu, and R. Gupta. Load the edges you need: A generic I\/O optimization for disk-based graph processing. In USENIX ATC, pages 507--522, 2014."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2992784"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660227"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037744"},{"key":"e_1_3_2_1_43_1","first-page":"387","volume-title":"USENIX ATC","author":"Wang K.","year":"2015","unstructured":"K. Wang , G. Xu , Z. Su , and Y. D. Liu . GraphQ: Graph query processing with abstraction refinement . In USENIX ATC , pages 387 -- 401 , 2015 . K. Wang, G. Xu, Z. Su, and Y. D. Liu. GraphQ: Graph query processing with abstraction refinement. In USENIX ATC, pages 387--401, 2015."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806849"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505750"},{"key":"e_1_3_2_1_46_1","volume-title":"HotCloud","author":"Zaharia M.","year":"2010","unstructured":"M. Zaharia , M. Chowdhury , M.J Franklin , S. Shenker , and I. Stoica . Spark: cluster computing with working sets . In HotCloud , 2010 . M. Zaharia, M. Chowdhury, M.J Franklin, S. Shenker, and I. Stoica. Spark: cluster computing with working sets. In HotCloud, 2010."},{"key":"e_1_3_2_1_47_1","volume-title":"HotCloud","author":"Zaharia M.","year":"2012","unstructured":"M. Zaharia , T. Das , H. Li , S. Shenker , and I. Stoica . Discretized streams: an efficient and fault-tolerant model for stream processing on large clusters . In HotCloud , 2012 . M. Zaharia, T. Das, H. Li, S. Shenker, and I. Stoica. Discretized streams: an efficient and fault-tolerant model for stream processing on large clusters. In HotCloud, 2012."},{"key":"e_1_3_2_1_48_1","volume-title":"Proceedings of the VLDB Endowment","volume":"4","author":"Zeitler E.","unstructured":"E. Zeitler and T. Risch . Massive scale-out of expensive continuous queries , In Proceedings of the VLDB Endowment , Vol. 4 , No. 11, 2011. E. Zeitler and T. Risch. Massive scale-out of expensive continuous queries, In Proceedings of the VLDB Endowment, Vol. 4, No. 11, 2011."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134002"},{"key":"e_1_3_2_1_50_1","first-page":"319","volume-title":"ICSE","author":"Zhang X.","year":"2003","unstructured":"X. Zhang , R. Gupta , and Y. Zhang . Precise dynamic slicing algorithms . In ICSE , pages 319 -- 329 , 2003 . X. Zhang, R. Gupta, and Y. Zhang. Precise dynamic slicing algorithms. In ICSE, pages 319--329, 2003."}],"event":{"name":"ASPLOS '17: Architectural Support for Programming Languages and Operating Systems","location":"Xi'an China","acronym":"ASPLOS '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGOPS ACM Special Interest Group on Operating Systems","SIGARCH ACM Special Interest Group on Computer Architecture","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3037697.3037748","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3037697.3037748","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3037697.3037748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:03:11Z","timestamp":1750201391000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3037697.3037748"}},"subtitle":["Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations"],"short-title":[],"issued":{"date-parts":[[2017,4,4]]},"references-count":50,"alternative-id":["10.1145\/3037697.3037748","10.1145\/3037697"],"URL":"https:\/\/doi.org\/10.1145\/3037697.3037748","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093336.3037748","asserted-by":"object"},{"id-type":"doi","id":"10.1145\/3093337.3037748","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,4,4]]},"assertion":[{"value":"2017-04-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}