{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:40Z","timestamp":1740123520654,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T00:00:00Z","timestamp":1544572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61640219"],"award-info":[{"award-number":["61640219"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s11227-018-2725-7","type":"journal-article","created":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T15:42:35Z","timestamp":1544629355000},"page":"3673-3692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A low-latency computing framework for time-evolving graphs"],"prefix":"10.1007","volume":"75","author":[{"given":"Shuo","family":"Ji","sequence":"first","affiliation":[]},{"given":"Yinliang","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Xiaomei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,12]]},"reference":[{"key":"2725_CR1","unstructured":"Amazon (2018) Amazon ec2. https:\/\/aws.amazon.com\/cn\/ec2\/"},{"key":"2725_CR2","unstructured":"Apache (2012) Apache giraph. http:\/\/giraph.apache.org\/"},{"key":"2725_CR3","doi-asserted-by":"crossref","unstructured":"Broder AZ, Lempel R, Maghoul F, Pedersen JO (2004) Efficient pagerank approximation via graph aggregation. In: International World Wide Web Conferences, pp 484\u2013485","DOI":"10.1145\/1013367.1013537"},{"key":"2725_CR4","doi-asserted-by":"crossref","unstructured":"Cai Z, Logothetis D, Siganos G (2012) Facilitating real-time graph mining. In: International Workshop on Cloud Data Management, ACM, pp 1\u20138","DOI":"10.1145\/2390021.2390023"},{"key":"2725_CR5","doi-asserted-by":"crossref","unstructured":"Cheng R, Hong J, Kyrola A, Miao Y, Weng X, Wu M, Yang F, Zhou L, Zhao F, Chen E (2012) Kineograph: taking the pulse of a fast-changing and connected world. In: European Conference on Computer Systems, ACM, pp 85\u201398","DOI":"10.1145\/2168836.2168846"},{"issue":"1","key":"2725_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"2725_CR7","doi-asserted-by":"crossref","unstructured":"Gaito S, Zignani M, Rossi GP, Sala A, Zhao X, Zheng H, Zhao BY (2012) On the bursty evolution of online social networks. In: Proceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks Research, pp 1\u20138","DOI":"10.1145\/2392622.2392623"},{"key":"2725_CR8","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) Powergraph: distributed graph-parallel computation on natural graphs. In: Operating Systems Design and Implementation, pp 17\u201330"},{"key":"2725_CR9","unstructured":"Gonzalez JE, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) Graphx: graph processing in a distributed dataflow framework. In: Operating Systems Design and Implementation, pp 599\u2013613"},{"key":"2725_CR10","doi-asserted-by":"crossref","unstructured":"Han W, Miao Y, Li K, Wu M, Yang F, Zhou L, Prabhakaran V, Chen W, Chen E (2014) Chronos: a graph engine for temporal graph analysis. In: European Conference on Computer Systems, pp 1\u201314","DOI":"10.1145\/2592798.2592799"},{"key":"2725_CR11","doi-asserted-by":"crossref","unstructured":"Iyer AP, Li LE, Das T, Stoica I (2016) Time-evolving graph processing at scale. In: International Workshop on Graph Data Management Experiences and Systems. ACM, pp 1\u20136","DOI":"10.1145\/2960414.2960419"},{"issue":"7","key":"2725_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.3390\/sym10070247","volume":"10","author":"S Ji","year":"2018","unstructured":"Ji S, Zhao Y (2018) A local approximation approach for processing time-evolving graphs. Symmetry 10(7):247","journal-title":"Symmetry"},{"issue":"3","key":"2725_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s11704-016-5485-7","volume":"10","author":"W Ju","year":"2016","unstructured":"Ju W, Li J, Yu W, Zhang R (2016) iGraph: an incremental data processing system for dynamic graph. Front Comput Sci 10(3):462\u2013476","journal-title":"Front Comput Sci"},{"key":"2725_CR14","doi-asserted-by":"crossref","unstructured":"Kan M, Thi HON (2005) Fast webpage classification using URL features. In: Conference on Information and Knowledge Management, pp 325\u2013326","DOI":"10.1145\/1099554.1099649"},{"key":"2725_CR15","unstructured":"Konect (2017) Konect network dataset. http:\/\/konect.uni-koblenz.de\/"},{"key":"2725_CR16","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: ACM SIGMOD International Conference on Management of Data. ACM, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"issue":"2","key":"2725_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2818185","volume":"48","author":"RR McCune","year":"2015","unstructured":"McCune RR, Weninger T, Madey G (2015) Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput Surv 48(2):25","journal-title":"ACM Comput Surv"},{"key":"2725_CR18","doi-asserted-by":"crossref","unstructured":"Morshed SJ, Rana J, Milrad M (2016) Real-time data analytics: an algorithmic perspective. In: International Conference on Data Mining, pp 311\u2013320","DOI":"10.1007\/978-3-319-40973-3_31"},{"key":"2725_CR19","doi-asserted-by":"crossref","unstructured":"Murray DG, Mcsherry F, Isaacs R, Isard M, Barham P, Abadi M (2013) Naiad: a timely dataflow system. In: Symposium on Operating Systems Principles, pp 439\u2013455","DOI":"10.1145\/2517349.2522738"},{"issue":"1","key":"2725_CR20","first-page":"107","volume":"11","author":"M Sha","year":"2017","unstructured":"Sha M, Li Y, He B, Tan KL (2017) Accelerating dynamic graph analytics on gpus. Very Large Data Bases 11(1):107\u2013120","journal-title":"Very Large Data Bases"},{"key":"2725_CR21","doi-asserted-by":"crossref","unstructured":"Shi X, Cui B, Shao Y, Tong Y (2016) Tornado: a system for real-time iterative analysis over evolving data. In: International Conference on Management of Data, pp 417\u2013430","DOI":"10.1145\/2882903.2882950"},{"key":"2725_CR22","unstructured":"TSP (2013) World TSP. http:\/\/www.math.uwaterloo.ca\/tsp\/world\/"},{"issue":"8","key":"2725_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103\u2013111","journal-title":"Commun ACM"},{"key":"2725_CR24","unstructured":"Vaquero LM, Cuadrado F, Logothetis D, Martella C (2013) xDGP: a dynamic graph processing system with adaptive partitioning. arXiv preprint arXiv:1309.1049"},{"key":"2725_CR25","unstructured":"Vaquero LM, Cuadrado F, Ripeanu M (2014) Systems for near real-time analysis of large-scale dynamic graphs. arXiv preprint arXiv:1410.1903"},{"key":"2725_CR26","doi-asserted-by":"crossref","unstructured":"Vazirgiannis M, Drosos D, Senellart P, Vlachou A (2008) Web page rank prediction with Markov models. In: International World Wide Web Conferences, pp 1075\u20131076","DOI":"10.1145\/1367497.1367663"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2725-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2725-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2725-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T02:38:26Z","timestamp":1694486306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2725-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,12]]},"references-count":26,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["2725"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2725-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2018,12,12]]},"assertion":[{"value":"12 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}