{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T01:12:00Z","timestamp":1780708320723,"version":"3.54.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319436586","type":"print"},{"value":"9783319436593","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43659-3_24","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T02:54:01Z","timestamp":1470624841000},"page":"319-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["GraphIn: An Online High Performance Incremental Graph Processing Framework"],"prefix":"10.1007","author":[{"given":"Dipanjan","family":"Sengupta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Narayanan","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xia","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theodore L.","family":"Willke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey","family":"Young","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Wolf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karsten","family":"Schwan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"24_CR1","unstructured":"Email Statistics: \n                      http:\/\/tinyurl.com\/o7pch5f"},{"key":"24_CR2","unstructured":"The University of Florida Sparse Matrix Collection: \n                      http:\/\/tinyurl.com\/me4w55"},{"key":"24_CR3","unstructured":"Twitter Statistics: \n                      http:\/\/tinyurl.com\/kcuhdcw"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Armstrong, T.G., Ponnekanti, V., Borthakur, D., Callaghan, M.: Linkbench: a database benchmark based on the facebook social graph. In: SIGMOD 2013, NY, USA (2013)","DOI":"10.1145\/2463676.2465296"},{"key":"24_CR5","unstructured":"Bell, N., Garland, M.: Efficient sparse matrix-vector multiplication on CUDA. NVIDIA Technical Report NVR-2008-004, NVIDIA Corporation, December 2008"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Ediger, D., Jiang, K., Riedy, J., Bader, D.: Massive streaming data analytics: a case study with clustering coefficients. In: IPDPSW 2010, pp. 1\u20138 (2010)","DOI":"10.1109\/IPDPSW.2010.5470687"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Ediger, D., McColl, R., Riedy, J., Bader, D.: Stinger: high performance data structure for streaming graphs. In: HPEC, September 2012","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Ediger, D., Riedy, J., Bader, D., Meyerhenke, H.: Tracking structure of streaming social networks. In: IPDPSW 2011, May 2011","DOI":"10.1109\/IPDPS.2011.326"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Fard, A., Abdolrashidi, A., Ramaswamy, L., Miller, J.: Towards efficient query processing on massive time-evolving graphs. In: CollaborateCom, October 2012","DOI":"10.4108\/icst.collaboratecom.2012.250532"},{"key":"24_CR10","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., et al.: Powergraph: distributed graph-parallel computation on natural graphs. In: OSDI 2012, Hollywood, CA. USENIX (2012)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Han, W., Miao, Y., Li, K., Wu, M., Yang, F., Zhou, L., Prabhakaran, V., Chen, W., Chen, E.: Chronos: a graph engine for temporal graph analysis. In: EuroSys (2014)","DOI":"10.1145\/2592798.2592799"},{"key":"24_CR12","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: Graphchi: large-scale graph computation on just a pc. In: OSDI 2012, Berkeley, CA, USA. USENIX Association (2012)"},{"issue":"8","key":"24_CR13","doi-asserted-by":"publisher","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Bickson, D., Gonzalez, J., et al.: Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endowment 5(8), 716\u2013727 (2012)","journal-title":"Proc. VLDB Endowment"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., et al.: Pregel: a system for large-scale graph processing. In: SIGMOD 2010, New York, NY, USA. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"McColl, R., Green, O., Bader, D.: A new parallel algorithm for connected components in dynamic graphs. In: HiPC, December 2013","DOI":"10.1109\/HiPC.2013.6799108"},{"key":"24_CR16","unstructured":"Murphy, R.C., Wheeler, K., Barrett, B., Ang, J.A.: Introducing the graph 500. In: Cray Users Group (CUG) (2010)"},{"issue":"9","key":"24_CR17","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.parco.2011.02.004","volume":"37","author":"SJ Plimpton","year":"2011","unstructured":"Plimpton, S.J., Devine, K.D.: Mapreduce in mpi for large-scale graph algorithms. Parallel Comput. 37(9), 610\u2013632 (2011)","journal-title":"Parallel Comput."},{"issue":"2","key":"24_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267\u2013305 (1996)","journal-title":"J. Algorithms"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Roy, A., Mihailovic, I., Zwaenepoel, W.: X-stream: edge-centric graph processing using streaming partitions. In: SOSP 2013, New York, NY, USA. ACM (2013)","DOI":"10.1145\/2517349.2522740"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Sengupta, D., Belapure, R., Schwan, K.: Multi-tenancy on gpgpu-based servers. In: VTDC 2013, New York, NY, USA, pp. 3\u201310. ACM (2013)","DOI":"10.1145\/2465829.2465830"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Sengupta, D., Goswami, A., Schwan, K., Pallavi, K.: Scheduling multi-tenant cloud workloads on accelerator-based systems. In: SC 2014, NJ, USA. IEEE (2014)","DOI":"10.1109\/SC.2014.47"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Sengupta, D., Song, S.L., Agarwal, K., Schwan, K.: Graphreduce: processing large-scale graphs on accelerator-based systems. In: SC 2015, NY, USA. ACM (2015)","DOI":"10.1109\/IPDPSW.2015.16"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Sengupta, D., Wang, Q., Volos, H. et al.: A framework for emulating non-volatilememory systemswith different performance characteristics. In: ICPE 2015, NY, USA (2015)","DOI":"10.1145\/2668930.2695529"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Slota, G.M., Rajamanickam, S., Madduri, K.: High-performance graph analytics on manycore processors. In: IPDPS 2015 IEEE International, pp. 17\u201327, May 2015","DOI":"10.1109\/IPDPS.2015.54"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: Graphscope: parameter-free mining of large time-evolving graphs. In: KDD 2007, New York, NY, USA. ACM (2007)","DOI":"10.1145\/1281192.1281266"},{"issue":"11","key":"24_CR26","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.14778\/2809974.2809983","volume":"8","author":"N Sundaram","year":"2015","unstructured":"Sundaram, N., Satish, N., Patwary, M.M.A., et al.: Graphmat: high performance graph analytics made productive. Proc. VLDB Endowment 8(11), 1214\u20131225 (2015)","journal-title":"Proc. VLDB Endowment"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Suzumura, T., Nishii, S., Ganse, M.: Towards large-scale graph stream processing platform. In: WWW 2014 Companion, Republic and Canton of Geneva, Switzerland (2014)","DOI":"10.1145\/2567948.2580051"},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Wilson, C., Boe, B,. Sala, A., Puttaswamy, K.P., Zhao, B.Y.: User interactions in social networks and their implications. In: EuroSys 2009, New York, NY, USA. ACM (2009)","DOI":"10.1145\/1519065.1519089"},{"issue":"11","key":"24_CR29","first-page":"1181","volume":"4","author":"E Zeitler","year":"2011","unstructured":"Zeitler, E., Risch, T.: Massive scale-out of expensive continuous queries. PVLDB 4(11), 1181\u20131188 (2011)","journal-title":"PVLDB"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2016: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43659-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T00:05:47Z","timestamp":1596931547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43659-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436586","9783319436593"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43659-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2016.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}