{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:42:19Z","timestamp":1771702939165,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":90,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T00:00:00Z","timestamp":1636761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1919021"],"award-info":[{"award-number":["1919021"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11,14]]},"DOI":"10.1145\/3458817.3480857","type":"proceedings-article","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T05:10:34Z","timestamp":1634793034000},"page":"1-15","source":"Crossref","is-referenced-by-count":6,"title":["ElGA"],"prefix":"10.1145","author":[{"given":"Kasimir","family":"Gabert","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaan","family":"Sancak","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Yusuf","family":"\u00d6zkaya","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00dcmit V.","family":"\u00c7ataly\u00fcrek","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236208"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98812-2_28"},{"key":"e_1_3_2_2_3_1","first-page":"5","volume-title":"Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems","author":"Arm K. J.","year":"2012","unstructured":"K. J. Arm , S. Guha , and A. McGregor . Graph sketches: sparsification, spanners, and subgraphs . In Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems , pages 5 -- 14 , 2012 . K. J. Arm, S. Guha, and A. McGregor. Graph sketches: sparsification, spanners, and subgraphs. In Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems, pages 5--14, 2012."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2017.2711009"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/320176.320180"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3184470.3184473"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3231751.3231764"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721672"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_2_10_1","volume-title":"The gap benchmark suite. arXiv preprint arXiv:1508.03619","author":"Beamer S.","year":"2015","unstructured":"S. Beamer , K. Asanovi\u0107 , and D. Patterson . The gap benchmark suite. arXiv preprint arXiv:1508.03619 , 2015 . S. Beamer, K. Asanovi\u0107, and D. Patterson. The gap benchmark suite. arXiv preprint arXiv:1508.03619, 2015."},{"key":"e_1_3_2_2_11_1","volume-title":"Practice of streaming and dynamic graphs: Concepts, models, systems, and parallelism. arXiv preprint arXiv:1912.12740","author":"Besta M.","year":"2019","unstructured":"M. Besta , M. Fischer , V. Kalavri , M. Kapralov , and T. Hoefler . Practice of streaming and dynamic graphs: Concepts, models, systems, and parallelism. arXiv preprint arXiv:1912.12740 , 2019 . M. Besta, M. Fischer, V. Kalavri, M. Kapralov, and T. Hoefler. Practice of streaming and dynamic graphs: Concepts, models, systems, and parallelism. arXiv preprint arXiv:1912.12740, 2019."},{"key":"e_1_3_2_2_12_1","volume-title":"Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. arXiv preprint arXiv:1910.09017","author":"Besta M.","year":"2019","unstructured":"M. Besta , E. Peter , R. Gerstenberger , M. Fischer , M. Podstawski , C. Barthels , G. Alonso , and T. Hoefler . Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. arXiv preprint arXiv:1910.09017 , 2019 . M. Besta, E. Peter, R. Gerstenberger, M. Fischer, M. Podstawski, C. Barthels, G. Alonso, and T. Hoefler. Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. arXiv preprint arXiv:1910.09017, 2019."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_2_15_1","volume-title":"Hdfs architecture guide. Hadoop Apache Project, 53(1--13):2","author":"Borthakur D.","year":"2008","unstructured":"D. Borthakur Hdfs architecture guide. Hadoop Apache Project, 53(1--13):2 , 2008 . D. Borthakur et al. Hdfs architecture guide. Hadoop Apache Project, 53(1--13):2, 2008."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3386135"},{"key":"e_1_3_2_2_17_1","volume-title":"Apache flunk: Stream and batch processing in a single engine. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 36(4)","author":"Carbone P.","year":"2015","unstructured":"P. Carbone , A. Katsifodimos , S. Ewen , V. Markl , S. Haridi , and K. Tzoumas . Apache flunk: Stream and batch processing in a single engine. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 36(4) , 2015 . P. Carbone, A. Katsifodimos, S. Ewen, V. Markl, S. Haridi, and K. Tzoumas. Apache flunk: Stream and batch processing in a single engine. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 36(4), 2015."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168846"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_2_23_1","volume-title":"Dynamo: Amazon's highly available key-value store. ACM SIGOPS operating systems review, 41(6):205--220","author":"DeCandia G.","year":"2007","unstructured":"G. DeCandia , D. Hastorun , M. Jampani , G. Kakulapati , A. Lakshman , A. Pilchin , S. Sivasubramanian , P. Vosshall , and W. Vogels . Dynamo: Amazon's highly available key-value store. ACM SIGOPS operating systems review, 41(6):205--220 , 2007 . G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available key-value store. ACM SIGOPS operating systems review, 41(6):205--220, 2007."},{"key":"e_1_3_2_2_24_1","first-page":"401","volume-title":"11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14)","author":"Dragojevi\u0107 A.","year":"2014","unstructured":"A. Dragojevi\u0107 , D. Narayanan , M. Castro , and O. Hodson . Farm: Fast remote memory . In 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14) , pages 401 -- 414 , 2014 . A. Dragojevi\u0107, D. Narayanan, M. Castro, and O. Hodson. Farm: Fast remote memory. In 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14), pages 401--414, 2014."},{"key":"e_1_3_2_2_25_1","unstructured":"ECMA. Data interchange on 12 7 mm 48-track magnetic tape cartridges - dlt1 format.  ECMA. Data interchange on 12 7 mm 48-track magnetic tape cartridges - dlt1 format."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"e_1_3_2_2_27_1","volume-title":"Sparsification---a technique for speeding up dynamic graph algorithms. Journal of the ACM (JACM), 44(5):669--696","author":"Eppstein D.","year":"1997","unstructured":"D. Eppstein , Z. Galil , G. F. Italiano , and A. Nissenzweig . Sparsification---a technique for speeding up dynamic graph algorithms. Journal of the ACM (JACM), 44(5):669--696 , 1997 . D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification---a technique for speeding up dynamic graph algorithms. Journal of the ACM (JACM), 44(5):669--696, 1997."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093742.3093913"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3324301.3324305"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035944"},{"key":"e_1_3_2_2_32_1","volume-title":"Adaptive asynchronous parallelization of graph algorithms. ACM Transactions on Database Systems (TODS), 45(2):1--45","author":"Fan W.","year":"2020","unstructured":"W. Fan , P. Lu , W. Yu , J. Xu , Q. Yin , X. Luo , J. Zhou , and R. Jin . Adaptive asynchronous parallelization of graph algorithms. ACM Transactions on Database Systems (TODS), 45(2):1--45 , 2020 . W. Fan, P. Lu, W. Yu, J. Xu, Q. Yin, X. Luo, J. Zhou, and R. Jin. Adaptive asynchronous parallelization of graph algorithms. ACM Transactions on Database Systems (TODS), 45(2):1--45, 2020."},{"key":"e_1_3_2_2_33_1","volume-title":"Parallelizing sequential graph computations. ACM Transactions on Database Systems (TODS), 43(4):1--39","author":"Fan W.","year":"2018","unstructured":"W. Fan , W. Yu , J. Xu , J. Zhou , X. Luo , Q. Yin , P. Lu , Y. Cao , and R. Xu . Parallelizing sequential graph computations. ACM Transactions on Database Systems (TODS), 43(4):1--39 , 2018 . W. Fan, W. Yu, J. Xu, J. Zhou, X. Luo, Q. Yin, P. Lu, Y. Cao, and R. Xu. Parallelizing sequential graph computations. ACM Transactions on Database Systems (TODS), 43(4):1--39, 2018."},{"key":"e_1_3_2_2_34_1","first-page":"27","volume-title":"2014 23rd International Conference on Parallel Architecture and Compilation Techniques (PACT)","author":"Fidel A.","year":"2014","unstructured":"A. Fidel , N. M. Amato , L. Rauchwerger , : A new algorithmic paradigm for parallel graph computations . In 2014 23rd International Conference on Parallel Architecture and Compilation Techniques (PACT) , pages 27 -- 38 . IEEE, 2014 . A. Fidel, N. M. Amato, L. Rauchwerger, et al. Kla: A new algorithmic paradigm for parallel graph computations. In 2014 23rd International Conference on Parallel Architecture and Compilation Techniques (PACT), pages 27--38. IEEE, 2014."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2012.06.006"},{"key":"e_1_3_2_2_36_1","volume-title":"Synopsis data structures for massive data sets. External memory algorithms, 50:39--70","author":"Gibbons P. B.","year":"1999","unstructured":"P. B. Gibbons and Y. Matias . Synopsis data structures for massive data sets. External memory algorithms, 50:39--70 , 1999 . P. B. Gibbons and Y. Matias. Synopsis data structures for massive data sets. External memory algorithms, 50:39--70, 1999."},{"key":"e_1_3_2_2_37_1","first-page":"599","volume-title":"11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14)","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 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14) , 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 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14), pages 599--613, 2014."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_3_2_2_39_1","article-title":"A cost-efficient auto-scaling algorithm for large-scale graph processing in cloud environments with heterogeneous resources","author":"Heidari S.","year":"2019","unstructured":"S. Heidari and R. Buyya . A cost-efficient auto-scaling algorithm for large-scale graph processing in cloud environments with heterogeneous resources . IEEE Transactions on Software Engineering , 2019 . S. Heidari and R. Buyya. A cost-efficient auto-scaling algorithm for large-scale graph processing in cloud environments with heterogeneous resources. IEEE Transactions on Software Engineering, 2019.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2016.38"},{"key":"e_1_3_2_2_41_1","volume-title":"Scalable graph processing frameworks: A taxonomy and open challenges. ACM Computing Surveys (CSUR), 51(3):1--53","author":"Heidari S.","year":"2018","unstructured":"S. Heidari , Y. Simmhan , R. N. Calheiros , and R. Buyya . Scalable graph processing frameworks: A taxonomy and open challenges. ACM Computing Surveys (CSUR), 51(3):1--53 , 2018 . S. Heidari, Y. Simmhan, R. N. Calheiros, and R. Buyya. Scalable graph processing frameworks: A taxonomy and open challenges. ACM Computing Surveys (CSUR), 51(3):1--53, 2018."},{"key":"e_1_3_2_2_42_1","first-page":"23","volume-title":"10th International Conference on Autonomic Computing (ICAC 13)","author":"Herbst N. R.","year":"2013","unstructured":"N. R. Herbst , S. Kounev , and R. Reussner . Elasticity in cloud computing: What it is, and what it is not . In 10th International Conference on Autonomic Computing (ICAC 13) , pages 23 -- 27 , 2013 . N. R. Herbst, S. Kounev, and R. Reussner. Elasticity in cloud computing: What it is, and what it is not. In 10th International Conference on Autonomic Computing (ICAC 13), pages 23--27, 2013."},{"key":"e_1_3_2_2_43_1","volume-title":"messaging for many applications. \"O'Reilly Media","author":"Hintjens P.","year":"2013","unstructured":"P. Hintjens . ZeroMQ : messaging for many applications. \"O'Reilly Media , Inc .\", 2013 . P. Hintjens. ZeroMQ: messaging for many applications. \"O'Reilly Media, Inc.\", 2013."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3030207.3030214"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_3_2_2_47_1","first-page":"309","volume-title":"12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15)","author":"Iyer A.","year":"2015","unstructured":"A. Iyer , L. E. Li , and I. Stoica . Celliq: Real-time cellular network analytics at scale . In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15) , pages 309 -- 322 , 2015 . A. Iyer, L. E. Li, and I. Stoica. Celliq: Real-time cellular network analytics at scale. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15), pages 309--322, 2015."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960419"},{"key":"e_1_3_2_2_49_1","first-page":"745","volume-title":"Proceedings of the 13th USENIX conference on Operating Systems Design and Implementation","author":"Iyer A. P.","year":"2018","unstructured":"A. P. Iyer , Z. Liu , X. Jin , S. Venkataraman , V. Braverman , and I. Stoica . Asap: fast, approximate graph pattern mining at scale . In Proceedings of the 13th USENIX conference on Operating Systems Design and Implementation , pages 745 -- 761 , 2018 . A. P. Iyer, Z. Liu, X. Jin, S. Venkataraman, V. Braverman, and I. Stoica. Asap: fast, approximate graph pattern mining at scale. In Proceedings of the 13th USENIX conference on Operating Systems Design and Implementation, pages 745--761, 2018."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2019.10.012"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064012"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2008.11.021"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45065-5_15"},{"key":"e_1_3_2_2_57_1","volume-title":"The dynamics of viral marketing. ACM Transactions on the Web (TWEB), 1(1):5--es","author":"Leskovec J.","year":"2007","unstructured":"J. Leskovec , L. A. Adamic , and B. A. Huberman . The dynamics of viral marketing. ACM Transactions on the Web (TWEB), 1(1):5--es , 2007 . J. Leskovec, L. A. Adamic, and B. A. Huberman. The dynamics of viral marketing. ACM Transactions on the Web (TWEB), 1(1):5--es, 2007."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_2_59_1","volume-title":"Graph evolution: Densification and shrinking diameters. ACM transactions on Knowledge Discovery from Data (TKDD), 1(1):2--es","author":"Leskovec J.","year":"2007","unstructured":"J. Leskovec , J. Kleinberg , and C. Faloutsos . Graph evolution: Densification and shrinking diameters. ACM transactions on Knowledge Discovery from Data (TKDD), 1(1):2--es , 2007 . J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM transactions on Knowledge Discovery from Data (TKDD), 1(1):2--es, 2007."},{"key":"e_1_3_2_2_60_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_2_63_1","volume-title":"Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Computing Surveys (CSUR), 48(2):1--39","author":"McCune R. R.","year":"2015","unstructured":"R. R. McCune , T. Weninger , and G. Madey . Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Computing Surveys (CSUR), 48(2):1--39 , 2015 . R. R. McCune, T. Weninger, and G. Madey. Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Computing Surveys (CSUR), 48(2):1--39, 2015."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627694"},{"key":"e_1_3_2_2_65_1","volume-title":"15th Workshop on Hot Topics in Operating Systems (HotOS XV)","author":"McSherry F.","year":"2015","unstructured":"F. McSherry , M. Isard , and D. G. Murray . Scalability! but at what COST ? In 15th Workshop on Hot Topics in Operating Systems (HotOS XV) , 2015 . F. McSherry, M. Isard, and D. G. Murray. Scalability! but at what COST? In 15th Workshop on Hot Topics in Operating Systems (HotOS XV), 2015."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-145"},{"key":"e_1_3_2_2_67_1","volume-title":"Introducing the graph 500","author":"Murphy R. C.","year":"2010","unstructured":"R. C. Murphy , K. B. Wheeler , B. W. Barrett , and J. A. Ang . Introducing the graph 500 . Cray Users Group (CUG) , 19:45--74, 2010 . R. C. Murphy, K. B. Wheeler, B. W. Barrett, and J. A. Ang. Introducing the graph 500. Cray Users Group (CUG), 19:45--74, 2010."},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3401025.3401734"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/IC2E.2016.31"},{"key":"e_1_3_2_2_71_1","volume-title":"New tweets per second record, and how! https:\/\/blog.twitter.com\/engineering\/en_us\/a\/2013\/new-tweets-per-second-record-and-how","year":"2013","unstructured":"@raffi. New tweets per second record, and how! https:\/\/blog.twitter.com\/engineering\/en_us\/a\/2013\/new-tweets-per-second-record-and-how , 2013 . Accessed June 28, 2021; Archive at https:\/\/web.archive.org\/web\/20210628160850\/ https:\/\/blog.twitter.com\/engineering\/en_us\/a\/2013\/new-tweets-per-second-record-and-how. @raffi. New tweets per second record, and how! https:\/\/blog.twitter.com\/engineering\/en_us\/a\/2013\/new-tweets-per-second-record-and-how, 2013. Accessed June 28, 2021; Archive at https:\/\/web.archive.org\/web\/20210628160850\/ https:\/\/blog.twitter.com\/engineering\/en_us\/a\/2013\/new-tweets-per-second-record-and-how."},{"key":"e_1_3_2_2_72_1","volume-title":"On the computational complexity of dynamic graph problems. Theor. Comput. Sci., 158(1--2):233--277","author":"Ramalingam G.","year":"1996","unstructured":"G. Ramalingam and T. Reps . On the computational complexity of dynamic graph problems. Theor. Comput. Sci., 158(1--2):233--277 , 1996 . G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. Theor. Comput. Sci., 158(1--2):233--277, 1996."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356206"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2714064.2660195"},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383071"},{"issue":"1","key":"e_1_3_2_2_77_1","first-page":"4","article-title":"The case for shared nothing","volume":"9","author":"Stonebraker M.","year":"1986","unstructured":"M. Stonebraker . The case for shared nothing . IEEE Database Eng. Bull. , 9 ( 1 ): 4 -- 9 , 1986 . M. Stonebraker. The case for shared nothing. IEEE Database Eng. Bull., 9(1):4--9, 1986.","journal-title":"IEEE Database Eng. Bull."},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2580051"},{"key":"e_1_3_2_2_79_1","volume-title":"International scientific conference and international workshop present day trends of innovations","author":"Takac L.","year":"2012","unstructured":"L. Takac and M. Zabovsky . Data analysis in public social networks . In International scientific conference and international workshop present day trends of innovations , 2012 . L. Takac and M. Zabovsky. Data analysis in public social networks. In International scientific conference and international workshop present day trends of innovations, 2012."},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_3_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPDC.2019.00012"},{"key":"e_1_3_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2018.00056"},{"key":"e_1_3_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.5555\/2672596.2672664"},{"key":"e_1_3_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037748"},{"key":"e_1_3_2_2_85_1","unstructured":"T. Wang. Integer hash function 1997. https:\/\/web.archive.org\/web\/20071223173210\/http:\/\/www.concentric.net\/~Ttwang\/tech\/inthash.htm.  T. Wang. Integer hash function 1997. https:\/\/web.archive.org\/web\/20071223173210\/http:\/\/www.concentric.net\/~Ttwang\/tech\/inthash.htm."},{"key":"e_1_3_2_2_86_1","first-page":"307","volume-title":"Proceedings of the 7th symposium on Operating systems design and implementation","author":"Weil S. A.","year":"2006","unstructured":"S. A. Weil , S. A. Brandt , E. L. Miller , D. D. Long , and C. Maltzahn . Ceph: A scalable, high-performance distributed file system . In Proceedings of the 7th symposium on Operating systems design and implementation , pages 307 -- 320 , 2006 . S. A. Weil, S. A. Brandt, E. L. Miller, D. D. Long, and C. Maltzahn. Ceph: A scalable, high-performance distributed file system. In Proceedings of the 7th symposium on Operating systems design and implementation, pages 307--320, 2006."},{"key":"e_1_3_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2898401"},{"key":"e_1_3_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806849"},{"key":"e_1_3_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_3_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"}],"event":{"name":"SC '21: The International Conference for High Performance Computing, Networking, Storage and Analysis","location":"St. Louis Missouri","acronym":"SC '21","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458817.3480857","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3458817.3480857","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3458817.3480857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:22Z","timestamp":1750191142000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458817.3480857"}},"subtitle":["elastic and scalable dynamic graph analysis"],"short-title":[],"issued":{"date-parts":[[2021,11,13]]},"references-count":90,"alternative-id":["10.1145\/3458817.3480857","10.1145\/3458817"],"URL":"https:\/\/doi.org\/10.1145\/3458817.3480857","relation":{},"subject":[],"published":{"date-parts":[[2021,11,13]]}}}