{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:37:17Z","timestamp":1779896237689,"version":"3.53.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319299181","type":"print"},{"value":"9783319299198","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29919-8_14","type":"book-chapter","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T12:52:15Z","timestamp":1456404735000},"page":"181-192","source":"Crossref","is-referenced-by-count":5,"title":["An Overview of Methods for Handling Evolving Graph Sequences"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Kosmatopoulos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kalliopi","family":"Giannakopoulou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Apostolos N.","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: 23rd International World Wide Web Conference, WWW 2014, Seoul, Republic of Korea, 7\u201311 April 2014, pp. 237\u2013248 (2014)","DOI":"10.1145\/2566486.2568007"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-319-11918-2_8","volume-title":"String Processing and Information Retrieval","author":"NR Brisaboa","year":"2014","unstructured":"Brisaboa, N.R., Caro, D., Fari\u00f1a, A., Rodr\u00edguez, M.A.: A compressed suffix-array strategy for temporal-graph indexing. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 77\u201388. Springer, Heidelberg (2014)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10791-006-9001-9","volume":"10","author":"NR Brisaboa","year":"2007","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Navarro, G., Param\u00e1, J.R.: Lightweight natural language text compression. Inf. Retr. 10(1), 1\u201333 (2007)","journal-title":"Inf. Retr."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2015.02.002","volume":"51","author":"D Caro","year":"2015","unstructured":"Caro, D., Rodr\u00edguez, M.A., Brisaboa, N.R.: Data structures for temporal graphs based on compact sequence representations. Inf. Syst. 51, 1\u201326 (2015)","journal-title":"Inf. Syst."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische mathematik"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319\u2013333. Springer, Heidelberg (2008)"},{"key":"14_CR7","unstructured":"Apache Giraph: http:\/\/giraph.apache.org\/"},{"key":"14_CR8","unstructured":"Huo, W., Tsotras, V.J.: Efficient temporal shortest path queries on evolving social graphs. In: Conference on Scientific and Statistical Database Management, SSDBM 2014, Aalborg, Denmark, June 30\u2013July 02, 2014, pp. 38:1\u201338:4 (2014)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Khurana, U., Deshpande, A.: Efficient snapshot retrieval over historical graph data. In: 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, 8\u201312 April 2013, pp. 997\u20131008 (2013)","DOI":"10.1109\/ICDE.2013.6544892"},{"key":"14_CR10","unstructured":"Koloniari, G., Souravlias, D., Pitoura, E.: On graph deltas for historical queries. In: WOSS (2012)"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10619-014-7140-3","volume":"33","author":"AG Labouseur","year":"2015","unstructured":"Labouseur, A.G., Birnbaum, J., Olsen, P.W., Spillane, S.R., Vijayan, J., Hwang, J., Han, W.: The G* graph database: efficiently managing large distributed dynamic graphs. Distrib. Parallel Databases 33(4), 479\u2013514 (2015)","journal-title":"Distrib. Parallel Databases"},{"key":"14_CR12","unstructured":"Labouseur, A.G., Olsen, P.W., Hwang, J.: Scalable and robust management of dynamic graph data. In: Proceedings of the First International Workshop on Big Dynamic Distributed Data, Riva del Garda, Italy, 30 August 2013, pp. 43\u201348 (2013)"},{"key":"14_CR13","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2004. http:\/\/snap.stanford.edu\/data"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, 6\u201310 June 2010, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"14_CR15","unstructured":"Neo4j: http:\/\/neo4j.org\/"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-36461-7_2","volume-title":"Temporal Networks","author":"V Nicosia","year":"2013","unstructured":"Nicosia, V., Tang, J., Mascolo, C., Musolesi, M., Russo, G., Latora, V.: Graph metrics for temporal networks. In: Holme, P., Saram\u00e4ki, J. (eds.) Temporal Networks, pp. 15\u201340. Springer, Heidelberg (2013)"},{"issue":"11","key":"14_CR17","first-page":"726","volume":"4","author":"C Ren","year":"2011","unstructured":"Ren, C., Lo, E., Kao, B., Zhu, X., Cheng, R.: On querying historical evolving graph sequences. PVLDB 4(11), 726\u2013737 (2011)","journal-title":"PVLDB"},{"key":"14_CR18","unstructured":"Semertzidis, K., Pitoura, E., Lillis, K.: Timereach: historical reachability queries on evolving graphs. In: Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, 23\u201327 March 2015, pp. 121\u2013132 (2015)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Shao, B., Wang, H., Li, Y.: Trinity: a distributed graph engine on a memory cloud. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, New York, NY, USA, 22\u201327 June 2013, pp. 505\u2013516 (2013)","DOI":"10.1145\/2463676.2467799"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Spillane, S.R., Birnbaum, J., Bokser, D., Kemp, D., Labouseur, A.G., Olsen, P.W., Vijayan, J., Hwang, J., Yoon, J.: A demonstration of the g $${_\\ast }$$ * graph database system. In: 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, 8\u201312 April 2013, pp. 1356\u20131359 (2013)","DOI":"10.1109\/ICDE.2013.6544943"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s11280-013-0204-x","volume":"17","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Yu, J.X., Gao, H., Pei, J., Li, J.: Mining most frequently changing component in evolving graphs. World Wide Web 17(3), 351\u2013376 (2014)","journal-title":"World Wide Web"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, J., Long, X., Suel, T.: Performance of compressed inverted list caching in search engines. In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, 21\u201325 April 2008, pp. 387\u2013396 (2008)","DOI":"10.1145\/1367497.1367550"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Zukowski, M., H\u00e9man, S., Nes, N., Boncz, P.A.: Super-scalar RAM-CPU cache compression. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, Atlanta, GA, USA, 3\u20138 April 2006, p. 59 (2006)","DOI":"10.1109\/ICDE.2006.150"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29919-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T14:23:46Z","timestamp":1748787826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29919-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299181","9783319299198"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29919-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}