{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:58:02Z","timestamp":1765357082851,"version":"build-2065373602"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/50021\/2020 and PTDC\/EEI-COM\/30644\/2017"],"award-info":[{"award-number":["UIDB\/50021\/2020 and PTDC\/EEI-COM\/30644\/2017"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Graphs are found in a plethora of domains, including online social networks, the World Wide Web and the study of epidemics, to name a few. With the advent of greater volumes of information and the need for continuously updated results under temporal constraints, it is necessary to explore alternative approaches that further enable performance improvements. In the scope of stream processing over graphs, we research the trade-offs between result accuracy and the speedup of approximate computation techniques. The relationships between the frequency of graph algorithm execution, the update rate and the type of update play an important role in applying these techniques. Herein we present V<jats:sc>eil<\/jats:sc>G<jats:sc>raph<\/jats:sc>, through which we conducted our research. We showcase an innovative model for approximate graph processing implemented in . We analyse the feasibility of our model and evaluate it with the case study of the PageRank algorithm, the most famous measure of vertex centrality used to rank websites in search engine results. Our experiments show that V<jats:sc>eil<\/jats:sc>G<jats:sc>raph<\/jats:sc> can often reduce latency closely to half (speedup of 2.0\u00d7), while achieving result quality above 95% when compared to results of the traditional version of PageRank executing in  with  (i.e. without any summarization or approximation techniques). In some cases, depending on the workload, speedups against  reach up to 3.0x (i.e. yielding a reduction of up to 66% in latency). We have found V<jats:sc>eil<\/jats:sc>G<jats:sc>raph<\/jats:sc> implementation on Flink to be scalable, as it is able to improve performance up to 10X speedups, when more resources are employed (16 workers), achieving better speedups with scale for larger graphs, which are the most relevant.<\/jats:p>","DOI":"10.1186\/s40537-022-00565-8","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T15:55:36Z","timestamp":1645631736000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["VeilGraph: incremental graph stream processing"],"prefix":"10.1186","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7191-5895","authenticated-orcid":false,"given":"Miguel E.","family":"Coimbra","sequence":"first","affiliation":[]},{"given":"S\u00e9rgio","family":"Esteves","sequence":"additional","affiliation":[]},{"given":"Alexandre P.","family":"Francisco","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9285-0736","authenticated-orcid":false,"given":"Lu\u00eds","family":"Veiga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"issue":"1","key":"565_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1186\/s40537-021-00443-9","volume":"8","author":"ME Coimbra","year":"2021","unstructured":"Coimbra ME, Francisco AP, Veiga L. An analysis of the graph processing landscape. J Big Data. 2021;8(1):55. https:\/\/doi.org\/10.1186\/s40537-021-00443-9.","journal-title":"J Big Data"},{"issue":"6","key":"565_CR2","first-page":"726","volume":"57","author":"F Chung","year":"2010","unstructured":"Chung F. Graph theory in the information age. Notice AMS. 2010;57(6):726\u201332.","journal-title":"Notice AMS"},{"key":"565_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1561\/106.00000003","volume":"1","author":"R Meusel","year":"2015","unstructured":"Meusel R, Vigna S, Lehmberg O, Bizer C. The graph structure in the web-analyzed on different aggregation levels. J Web Sci. 2015;1:89.","journal-title":"J Web Sci."},{"issue":"9","key":"565_CR4","doi-asserted-by":"publisher","first-page":"3981","DOI":"10.1021\/acs.jcim.9b00387","volume":"59","author":"J Lim","year":"2019","unstructured":"Lim J, Ryu S, Park K, Choe YJ, Ham J, Kim WY. Predicting drug-target interaction using a novel graph neural network with 3D structure-embedded graph representation. J Chem Inf Model. 2019;59(9):3981\u20138.","journal-title":"J Chem Inf Model"},{"issue":"1","key":"565_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-020-00383-w","volume":"8","author":"S Liang","year":"2021","unstructured":"Liang S, Stockinger K, de Farias TM, Anisimova M, Gil M. Querying knowledge graphs in natural language. J Big Data. 2021;8(1):1\u201323.","journal-title":"J Big Data"},{"key":"565_CR6","unstructured":"Donnelly Gordon. 75 Super-Useful Facebook Statistics for 2018. Accessed 5 May 2020. 2020."},{"issue":"1","key":"565_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-020-00366-x","volume":"7","author":"P Pho","year":"2020","unstructured":"Pho P, Mantzaris AV. Regularized simple graph convolution (sgc) for improved interpretability of large datasets. J Big Data. 2020;7(1):1\u201317.","journal-title":"J Big Data"},{"issue":"1","key":"565_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-021-00485-z","volume":"8","author":"I Sassi","year":"2021","unstructured":"Sassi I, Anter S, Bekkhoucha A. A graph-based big data optimization approach using hidden markov model and constraint satisfaction problem. J Big Data. 2021;8(1):1\u201329.","journal-title":"J Big Data"},{"key":"565_CR9","first-page":"78","volume":"9","author":"M Chinazzi","year":"2020","unstructured":"Chinazzi M, Davis JT, Ajelli M, Gioannini C, Litvinova M, Merler S, Piontti AP, Mu K, Rossi L, Sun K, et al. The effect of travel restrictions on the spread of the 2019 novel coronavirus (covid-19) outbreak. Science. 2020;9:78.","journal-title":"Science."},{"issue":"1","key":"565_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-019-0218-z","volume":"6","author":"I Maduako","year":"2019","unstructured":"Maduako I, Wachowicz M, Hanson T. Stvg: an evolutionary graph framework for analyzing fast-evolving networks. J Big Data. 2019;6(1):1\u201324.","journal-title":"J Big Data"},{"issue":"1","key":"565_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-017-0074-7","volume":"4","author":"S Chowdhury","year":"2017","unstructured":"Chowdhury S, Khanzadeh M, Akula R, Zhang F, Zhang S, Medal H, Marufuzzaman M, Bian L. Botnet detection using graph-based feature clustering. J Big Data. 2017;4(1):1\u201323.","journal-title":"J Big Data"},{"key":"565_CR12","doi-asserted-by":"publisher","unstructured":"Junghanns M, Petermann A, Teichmann N, G\u00f3mez K, Rahm E. Analyzing extended property graphs with apache flink. In: Proceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics. NDA \u201916. 2016. New York: ACM. p. 3\u2013138. https:\/\/doi.org\/10.1145\/2980523.2980527.","DOI":"10.1145\/2980523.2980527"},{"key":"565_CR13","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"AN Langville","year":"2011","unstructured":"Langville AN, Meyer CD. Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton: Princeton University Press; 2011."},{"issue":"1","key":"565_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC. A set of measures of centrality based on betweenness. Sociometry. 1977;40(1):35\u201341.","journal-title":"Sociometry"},{"issue":"1","key":"565_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L. A new status index derived from sociometric analysis. Psychometrika. 1953;18(1):39\u201343. https:\/\/doi.org\/10.1007\/BF02289026.","journal-title":"Psychometrika"},{"key":"565_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2010","unstructured":"Newman M. Networks: An Introduction. New York: Oxford University Press Inc; 2010."},{"issue":"5\u20136","key":"565_CR17","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.physrep.2003.09.002","volume":"388","author":"DV Vassilevich","year":"2003","unstructured":"Vassilevich DV. Heat kernel expansion: user\u2019s manual. Phys Rep. 2003;388(5\u20136):279\u2013360.","journal-title":"Phys Rep"},{"key":"565_CR18","doi-asserted-by":"crossref","unstructured":"Boldi P, Rosa M, Santini M, Vigna S. Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks. In: Srinivasan S, Ramamritham K, Kumar A, Ravindra MP, Bertino E, Kumar R, (eds.) Proceedings of the 20th International Conference on World Wide Web. ACM: New York. 2011. p. 587\u2013596","DOI":"10.1145\/1963405.1963488"},{"key":"565_CR19","doi-asserted-by":"crossref","unstructured":"Chung F, Simpson O. Distributed algorithms for finding local clusters using heat kernel pagerank. In: International Workshop on Algorithms and Models for the Web-Graph, pp. 177\u2013189. Springer: Cham. 2015.","DOI":"10.1007\/978-3-319-26784-5_14"},{"key":"565_CR20","doi-asserted-by":"publisher","unstructured":"Coimbra ME, Selimi M, Francisco AP, Freitag F, Veiga L. Gelly-scheduling: distributed graph processing for service placement in community networks. In: Haddad HM, Wainwright RL, Chbeir R, eds. Proceedings of the 33rd Annual ACM Symposium on Applied Computing, SAC 2018, Pau, France, April 09-13, 2018. ACM: New York; 2018. p. 151\u2013160. https:\/\/doi.org\/10.1145\/3167132.3167147.","DOI":"10.1145\/3167132.3167147"},{"key":"565_CR21","doi-asserted-by":"publisher","unstructured":"Agarwal S, Milner H, Kleiner A, Talwalkar A, Jordan M, Madden S, Mozafari B, Stoica I. Knowing when You\u2019Re Wrong: Building Fast and Reliable Approximate Query Processing Systems. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. SIGMOD \u201914. New York: ACM. p. 481\u2013492. 2014. https:\/\/doi.org\/10.1145\/2588555.2593667.","DOI":"10.1145\/2588555.2593667"},{"issue":"1","key":"565_CR22","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1145\/2786763.2694351","volume":"43","author":"I Goiri","year":"2015","unstructured":"Goiri I, Bianchini R, Nagarakatte S, Nguyen TD. Approxhadoop: Bringing approximations to mapreduce frameworks. SIGARCH Comput Archit News. 2015;43(1):383\u201397. https:\/\/doi.org\/10.1145\/2786763.2694351.","journal-title":"SIGARCH Comput Archit News"},{"key":"565_CR23","unstructured":"Babcock B, Datar M, Motwani R. Sampling from a moving window over streaming data. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201902, pp. 633\u2013634. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA. 2002. http:\/\/dl.acm.org\/citation.cfm?id=545381.545465."},{"key":"565_CR24","unstructured":"Hu P, Lau WC. A Survey and Taxonomy of Graph Sampling. 2013. arXiv:1308.5865."},{"issue":"11","key":"565_CR25","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.14778\/3137628.3137651","volume":"10","author":"NK Ahmed","year":"2017","unstructured":"Ahmed NK, Duffield N, Willke TL, Rossi RA. On sampling from massive graph streams. Proc VLDB Endow. 2017;10(11):1430\u201341. https:\/\/doi.org\/10.14778\/3137628.3137651.","journal-title":"Proc VLDB Endow"},{"key":"565_CR26","doi-asserted-by":"publisher","unstructured":"Ahn KJ, Guha S, McGregor A. Graph sketches: Sparsification, spanners, and subgraphs. In: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. PODS \u201912. ACM: New York. 2012. p. 5\u201314. https:\/\/doi.org\/10.1145\/2213556.2213560.","DOI":"10.1145\/2213556.2213560"},{"issue":"3","key":"565_CR27","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1080\/15427951.2004.10129090","volume":"1","author":"S Chien","year":"2003","unstructured":"Chien S, Dwork C, Kumar R, Simon DR, Sivakumar D. Link Evolutions: Analysis and Algorithms. Internet Math. 2003;1(3):277\u2013304.","journal-title":"Internet Math"},{"key":"565_CR28","unstructured":"Babcock BB, Datar M, Motwani R, Mayur BB, Babcock BB, Datar M, Motwani R. Load Shedding Techniques for Data Stream Systems. In: In Proc. of the 2003 Workshop on Management and Processing of Data Streams (MPDS, 2003;pp. 1\u20133. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.5.1941."},{"issue":"9","key":"565_CR29","doi-asserted-by":"publisher","first-page":"672","DOI":"10.14778\/2947618.2947623","volume":"9","author":"V Kalavri","year":"2016","unstructured":"Kalavri V, Simas T, Logothetis D. The shortest path is not always a straight line: leveraging semi-metricity in graph analysis. Proc VLDB Endowment. 2016;9(9):672\u201383.","journal-title":"Proc VLDB Endowment"},{"key":"565_CR30","doi-asserted-by":"publisher","unstructured":"Langville AN, Meyer CD. Updating pagerank with iterative aggregation. In: Proceedings of the 13th International World Wide Web Conference on Alternate Track Papers&Amp; Posters. WWW Alt. \u201904, pp. 392\u2013393. ACM, New York, NY, USA. 2004. https:\/\/doi.org\/10.1145\/1013367.1013491. http:\/\/doi.acm.org\/10.1145\/1013367.1013491.","DOI":"10.1145\/1013367.1013491"},{"key":"565_CR31","doi-asserted-by":"publisher","unstructured":"Kalavri V, Ewen S, Tzoumas K, Vlassov V, Markl V, Haridi S. Asymmetry in large-scale graph analysis, explained. In: Proceedings of Workshop on GRAph Data Management Experiences and Systems. GRADES\u201914. New York: ACM. p. 4\u2013147. 2014. https:\/\/doi.org\/10.1145\/2621934.2621940.","DOI":"10.1145\/2621934.2621940"},{"key":"565_CR32","doi-asserted-by":"publisher","unstructured":"Malewicz G, Austern MH, Bik AJC, Dehnert JC, Horn I, Leiser N, Czajkowski G. Pregel: A System for Large-scale Graph Processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data. SIGMOD \u201910, pp. 135\u2013146. New York: ACM. 2010. https:\/\/doi.org\/10.1145\/1807167.1807184.","DOI":"10.1145\/1807167.1807184"},{"key":"565_CR33","unstructured":"Page L, Brin S, Motwani R, Winograd T. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report 1999-66, Stanford InfoLab. 1999. http:\/\/ilpubs.stanford.edu:8090\/422\/."},{"key":"565_CR34","doi-asserted-by":"publisher","unstructured":"Boldi P, Vigna S. The WebGraph framework I: Compression techniques. In: Feldman, S.I., Uretsky, M., Najork, M., Wills, C.E. (eds.) Proceedings of the 13th International Conference on World Wide Web, WWW 2004, New York, NY, USA, May 17-20, 2004. New York: ACM. p. 595\u2013602; 2004. https:\/\/doi.org\/10.1145\/988672.988752.","DOI":"10.1145\/988672.988752"},{"issue":"4","key":"565_CR35","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1852102.1852106","volume":"28","author":"W Webber","year":"2010","unstructured":"Webber W, Moffat A, Zobel J. A similarity measure for indefinite rankings. ACM Trans Inf Syst. 2010;28(4):20\u201312038. https:\/\/doi.org\/10.1145\/1852102.1852106.","journal-title":"ACM Trans Inf Syst"},{"issue":"1","key":"565_CR36","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TKDE.2017.2754371","volume":"30","author":"A Moffat","year":"2018","unstructured":"Moffat A. Computing maximized effectiveness distance for recall-based metrics. IEEE Transa Knowl Data Eng. 2018;30(1):198\u2013203.","journal-title":"IEEE Transa Knowl Data Eng"},{"key":"565_CR37","doi-asserted-by":"publisher","unstructured":"Reda W, Canini M, Suresh L, Kosti\u0107 D, Braithwaite S. Rein: Taming tail latency in key-value stores via multiget scheduling. In: Proceedings of the Twelfth European Conference on Computer Systems. EuroSys \u201917, pp. 95\u2013110. Association for Computing Machinery, New York, NY, USA. 2017. https:\/\/doi.org\/10.1145\/3064176.3064209.","DOI":"10.1145\/3064176.3064209"},{"key":"565_CR38","doi-asserted-by":"publisher","unstructured":"Misra PA, Borge MF, Goiri In, Lebeck AR, Zwaenepoel W, Bianchini R. Managing tail latency in datacenter-scale file systems under production constraints. In: Proceedings of the Fourteenth EuroSys Conference 2019. EuroSys \u201919. Association for Computing Machinery, New York, NY, USA. 2019. https:\/\/doi.org\/10.1145\/3302424.3303973.","DOI":"10.1145\/3302424.3303973"},{"key":"565_CR39","doi-asserted-by":"publisher","unstructured":"Gustafson JL. Gustafson\u2019s Law, pp. 819\u2013825. Springer, Boston. 2011. https:\/\/doi.org\/10.1007\/978-0-387-09766-4_78.","DOI":"10.1007\/978-0-387-09766-4_78"},{"key":"565_CR40","doi-asserted-by":"publisher","unstructured":"Cheng R, Hong J, Kyrola A, Miao Y, Weng X, Wu M, Yang F, Zhou L, Zhao F, Chen E. Kineograph: Taking the pulse of a fast-changing and connected world. In: Proceedings of the 7th ACM European Conference on Computer Systems. EuroSys \u201912, pp. 85\u201398. ACM, New York, NY, USA. 2012. https:\/\/doi.org\/10.1145\/2168836.2168846.","DOI":"10.1145\/2168836.2168846"},{"key":"565_CR41","doi-asserted-by":"publisher","unstructured":"Vora K, Gupta R, Xu G. Kickstarter: Fast and accurate computations on streaming graphs via trimmed approximations. In: Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems. ASPLOS \u201917, pp. 237\u2013251. ACM, New York, NY, USA. 2017. https:\/\/doi.org\/10.1145\/3037697.3037748.","DOI":"10.1145\/3037697.3037748"},{"key":"565_CR42","doi-asserted-by":"publisher","unstructured":"Shi X, Cui B, Shao Y, Tong Y. Tornado: A system for real-time iterative analysis over evolving data. In: Proceedings of the 2016 International Conference on Management of Data. SIGMOD \u201916, pp. 417\u2013430. ACM, New York, NY, USA. 2016. https:\/\/doi.org\/10.1145\/2882903.2882950.","DOI":"10.1145\/2882903.2882950"},{"key":"565_CR43","doi-asserted-by":"publisher","unstructured":"Murray DG, McSherry F, Isaacs R, Isard M, Barham P, Abadi M. Naiad: A timely dataflow system. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles. SOSP \u201913, pp. 439\u2013455. ACM, New York, NY, USA. 2013. https:\/\/doi.org\/10.1145\/2517349.2522738.","DOI":"10.1145\/2517349.2522738"},{"key":"565_CR44","doi-asserted-by":"publisher","unstructured":"Mariappan M, Vora K. Graphbolt: Dependency-driven synchronous processing of streaming graphs. In: Proceedings of the Fourteenth EuroSys Conference 2019. EuroSys \u201919, pp. 25\u201312516. ACM, New York. 2019. https:\/\/doi.org\/10.1145\/3302424.3303974.","DOI":"10.1145\/3302424.3303974"},{"key":"565_CR45","doi-asserted-by":"crossref","unstructured":"Chaudhry HN. Flowgraph: Distributed temporal pattern detection over dynamically evolving graphs. In: Proceedings of the 13th ACM International Conference on Distributed and Event-based Systems, 2019; p. 272\u2013275.","DOI":"10.1145\/3328905.3332303"},{"key":"565_CR46","unstructured":"Ching A. Scaling apache giraph to a trillion edges. Facebook Engineering Blog; 2013. p. 25."},{"issue":"3","key":"565_CR47","doi-asserted-by":"publisher","first-page":"193","DOI":"10.14778\/2732232.2732238","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian Y, Balmin A, Corsten SA, Tatikonda S, McPherson J. From \u201cthink like a vertex\u2019\u2019 to \u201cthink like a graph\u2019\u2019. Proc VLDB Endow. 2013;7(3):193\u2013204. https:\/\/doi.org\/10.14778\/2732232.2732238.","journal-title":"Proc VLDB Endow"},{"key":"565_CR48","doi-asserted-by":"publisher","unstructured":"Xin RS, Gonzalez JE, Franklin MJ, Stoica I. Graphx: A resilient distributed graph system on spark. In: First International Workshop on Graph Data Management Experiences and Systems. GRADES \u201913, pp. 2\u2013126. ACM, New York, NY, USA. 2013. https:\/\/doi.org\/10.1145\/2484425.2484427.","DOI":"10.1145\/2484425.2484427"},{"key":"565_CR49","doi-asserted-by":"publisher","unstructured":"Roy A, Bindschaedler L, Malicevic J, Zwaenepoel W. Chaos: Scale-out graph processing from secondary storage. In: Proceedings of the 25th Symposium on Operating Systems Principles. SOSP \u201915, pp. 410\u2013424. ACM, New York, NY, USA. 2015. https:\/\/doi.org\/10.1145\/2815400.2815408. http:\/\/doi.acm.org\/10.1145\/2815400.2815408.","DOI":"10.1145\/2815400.2815408"},{"key":"565_CR50","doi-asserted-by":"publisher","unstructured":"Roy A, Mihailovic I, Zwaenepoel W. X-stream: Edge-centric graph processing using streaming partitions. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles. SOSP \u201913, pp. 472\u2013488. ACM, New York, NY, USA. 2013. https:\/\/doi.org\/10.1145\/2517349.2522740. http:\/\/doi.acm.org\/10.1145\/2517349.2522740.","DOI":"10.1145\/2517349.2522740"},{"issue":"9","key":"565_CR51","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/3434642","volume":"64","author":"S Sakr","year":"2021","unstructured":"Sakr S, Bonifati A, Voigt H, Iosup A, Ammar K, Angles R, Aref W, Arenas M, Besta M, Boncz PA, Daudjee K, Valle ED, Dumbrava S, Hartig O, Haslhofer B, Hegeman T, Hidders J, Hose K, Iamnitchi A, Kalavri V, Kapp H, Martens W, \u00d6zsu MT, Peukert E, Plantikow S, Ragab M, Ripeanu MR, Salihoglu S, Schulz C, Selmer P, Sequeda JF, Shinavier J, Sz\u00e1rnyas G, Tommasini R, Tumeo A, Uta A, Varbanescu AL, Wu H-Y, Yakovets N, Yan D, Yoneki E. The future is big graphs: A community view on graph processing systems. Commun ACM. 2021;64(9):62\u201371. https:\/\/doi.org\/10.1145\/3434642.","journal-title":"Commun. ACM"},{"key":"565_CR52","unstructured":"Datar M, Gionis A, Indyk P, Motwani R. Maintaining stream statistics over sliding windows: (extended abstract). In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201902, pp. 635\u2013644. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA. 2002. http:\/\/dl.acm.org\/citation.cfm?id=545381.545466."},{"key":"565_CR53","doi-asserted-by":"crossref","unstructured":"Arasu A, Manku GS. Approximate counts and quantiles over sliding windows. In: Proceedings of the 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 2004. Association for Computing Machinery, Inc., ??? 2004. https:\/\/www.microsoft.com\/en-us\/research\/publication\/approximate-counts-and-quantiles-over-sliding-windows\/.","DOI":"10.1145\/1055558.1055598"},{"issue":"1","key":"565_CR54","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter JS. Random sampling with a reservoir. ACM Trans Math Softw. 1985;11(1):37\u201357. https:\/\/doi.org\/10.1145\/3147.3165.","journal-title":"ACM Trans. Math. Softw."},{"key":"565_CR55","doi-asserted-by":"publisher","unstructured":"Feigenbaum J, Kannan S, McGregor A, Suri S, Zhang J. On graph problems in a semi-streaming model. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings. Lecture Notes in Computer Science, vol. 3142, pp. 531\u2013543. Springer, ??? 2004. https:\/\/doi.org\/10.1007\/978-3-540-27836-8_46.","DOI":"10.1007\/978-3-540-27836-8_46"},{"key":"565_CR56","unstructured":"Besta M, Fischer M, Kalavri V, Kapralov M, Hoefler T. Practice of streaming and dynamic graphs: Concepts, models, systems, and parallelism. arXiv preprint arXiv:1912.12740 2019."},{"key":"565_CR57","unstructured":"Kalavri V, Carbone P, Bali D, Abbas Z. Gelly Streaming. [Online, GitHub; accessed 24-April-2020] 2019. https:\/\/github.com\/vasia\/gelly-streaming."},{"key":"565_CR58","unstructured":"Ananthanarayanan G, Hung MC-C, Ren X, Stoica I, Wierman A, Yu M. Grass: Trimming stragglers in approximation analytics. In: 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14), pp. 289\u2013302. USENIX Association, Seattle, WA. 2014. https:\/\/www.usenix.org\/conference\/nsdi14\/technical-sessions\/presentation\/ananthanarayanan."},{"issue":"1","key":"565_CR59","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1186\/s40537-019-0264-6","volume":"6","author":"NR Al-Molhem","year":"2019","unstructured":"Al-Molhem NR, Rahal Y, Dakkak M. Social network analysis in telecom data. Journal of Big Data. 2019;6(1):99.","journal-title":"Journal of Big Data"},{"issue":"1","key":"565_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-016-0060-5","volume":"3","author":"H Zhang","year":"2016","unstructured":"Zhang H, Raitoharju J, Kiranyaz S, Gabbouj M. Limited random walk algorithm for big graph data clustering. Journal of Big Data. 2016;3(1):1\u201322.","journal-title":"Journal of Big Data"},{"key":"565_CR61","doi-asserted-by":"publisher","unstructured":"Esteves S, Galhardas H, Veiga L. Adaptive execution of continuous and data-intensive workflows with machine learning. In: Ferreira, P., Shrira, L. (eds.) Proceedings of the 19th International Middleware Conference, Middleware 2018, Rennes, France, December 10\u201314, 2018, pp. 239\u2013252. New York: ACM; 2018. https:\/\/doi.org\/10.1145\/3274808.3274827.","DOI":"10.1145\/3274808.3274827"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-022-00565-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-022-00565-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-022-00565-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T16:00:37Z","timestamp":1645632037000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-022-00565-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,23]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["565"],"URL":"https:\/\/doi.org\/10.1186\/s40537-022-00565-8","relation":{},"ISSN":["2196-1115"],"issn-type":[{"type":"electronic","value":"2196-1115"}],"subject":[],"published":{"date-parts":[[2022,2,23]]},"assertion":[{"value":"7 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"23"}}