{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:45:34Z","timestamp":1759333534334,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:00:00Z","timestamp":1553644800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00607-019-00715-6","type":"journal-article","created":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T09:09:25Z","timestamp":1553677765000},"page":"1885-1908","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Hinode: implementing a vertex-centric modelling approach to maintaining historical graph data"],"prefix":"10.1007","volume":"101","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5334-741X","authenticated-orcid":false,"given":"Andreas","family":"Kosmatopoulos","sequence":"first","affiliation":[]},{"given":"Anastasios","family":"Gounaris","sequence":"additional","affiliation":[]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,27]]},"reference":[{"key":"715_CR1","doi-asserted-by":"crossref","unstructured":"Akiba T, Iwata Y, Yoshida Y (2014) Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: 23rd international world wide web conference, WWW\u201914, pp 237\u2013248","DOI":"10.1145\/2566486.2568007"},{"key":"715_CR2","unstructured":"Apache Giraph. \n                    http:\/\/giraph.apache.org\/\n                    \n                  . Accessed 12 July 2018"},{"issue":"5439","key":"715_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"715_CR4","first-page":"599","volume":"14","author":"JE Gonzalez","year":"2014","unstructured":"Gonzalez JE, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) Graphx: graph processing in a distributed dataflow framework. OSDI 14:599\u2013613","journal-title":"OSDI"},{"key":"715_CR5","doi-asserted-by":"crossref","unstructured":"Huo W, Tsotras VJ (2014) Efficient temporal shortest path queries on evolving social graphs. In: Conference on scientific and statistical database management, SSDBM \u201914, pp 38:1\u201338:4","DOI":"10.1145\/2618243.2618282"},{"key":"715_CR6","doi-asserted-by":"crossref","unstructured":"Khurana U, Deshpande A (2013) Efficient snapshot retrieval over historical graph data. In: 29th IEEE international conference on data engineering, ICDE 2013, Brisbane, April 8\u201312, pp 997\u20131008","DOI":"10.1109\/ICDE.2013.6544892"},{"key":"715_CR7","unstructured":"Khurana U, Deshpande A (2016) Storing and analyzing historical graph data at scale. In: Proceedings of the 19th international conference on extending database technology, EDBT 2016, pp 65\u201376"},{"key":"715_CR8","doi-asserted-by":"crossref","unstructured":"Kosmatopoulos A, Giannakopoulou K, Papadopoulos AN, Tsichlas K (2016) An overview of methods for handling evolving graph sequences. In: Algorithmic aspects of cloud computing, pp 181\u2013192. Springer, Berlin","DOI":"10.1007\/978-3-319-29919-8_14"},{"key":"715_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10619-017-7207-z","volume":"35","author":"A Kosmatopoulos","year":"2017","unstructured":"Kosmatopoulos A, Tsichlas K, Gounaris A, Sioutas S, Pitoura E (2017) Hinode: an asymptotically space-optimal storage model for historical queries on graphs. Distrib Parallel Databases 35:249. \n                    https:\/\/doi.org\/10.1007\/s10619-017-7207-z","journal-title":"Distrib Parallel Databases"},{"issue":"4","key":"715_CR10","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10619-014-7140-3","volume":"33","author":"AG Labouseur","year":"2015","unstructured":"Labouseur AG, Birnbaum J, Olsen PW, Spillane SR, Vijayan J, Hwang J, Han W (2015) The g* graph database: efficiently managing large distributed dynamic graphs. Distrib and Parallel Databases 33(4):479\u2013514","journal-title":"Distrib and Parallel Databases"},{"key":"715_CR11","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. \n                    http:\/\/snap.stanford.edu\/data"},{"key":"715_CR12","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: Proceedings of the 2010 ACM SIGMOD international conference on management of data, pp 135\u2013146. ACM","DOI":"10.1145\/1807167.1807184"},{"issue":"11","key":"715_CR13","first-page":"726","volume":"4","author":"C Ren","year":"2011","unstructured":"Ren C, Lo E, Kao B, Zhu X, Cheng R (2011) On querying historical evolving graph sequences. PVLDB 4(11):726\u2013737","journal-title":"PVLDB"},{"issue":"2","key":"715_CR14","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/319806.319816","volume":"31","author":"B Salzberg","year":"1999","unstructured":"Salzberg B, Tsotras VJ (1999) Comparison of access methods for time-evolving data. ACM Comput Surv (CSUR) 31(2):158\u2013221","journal-title":"ACM Comput Surv (CSUR)"},{"key":"715_CR15","doi-asserted-by":"crossref","unstructured":"Semertzidis K, Pitoura E (2016) Durable graph pattern queries on historical graphs. In: 32nd IEEE international conference on data engineering, ICDE 2016, Helsinki, May 16\u201320, 2016, pp 541\u2013552","DOI":"10.1109\/ICDE.2016.7498269"},{"key":"715_CR16","unstructured":"Semertzidis K, Pitoura E, Lillis K (2015) Timereach: historical reachability queries on evolving graphs. In: Proceedings of the 18th international conference on extending database technology, EDBT 2015, Brussels, Belgium, March 23\u201327, pp 121\u2013132"},{"key":"715_CR17","doi-asserted-by":"crossref","unstructured":"Shao B, Wang H, Li Y (2013) Trinity: a distributed graph engine on a memory cloud. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2013, pp 505\u2013516","DOI":"10.1145\/2463676.2467799"},{"key":"715_CR18","unstructured":"Spillane SR, Birnbaum J, Bokser D, Kemp D, Labouseur AG, Olsen PW, Vijayan J, Hwang J, Yoon J (2013) A demonstration of the \n                    \n                      \n                    \n                    $$\\text{G}_{\\ast }$$\n                    \n                      \n                        \n                          G\n                          *\n                        \n                      \n                    \n                   graph database system. In: 29th IEEE international conference on data engineering, ICDE 2013, Brisbane, April 8\u201312, pp 1356\u20131359"},{"issue":"3","key":"715_CR19","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 JX, Gao H, Pei J, Li J (2014) Mining most frequently changing component in evolving graphs. World Wide Web 17(3):351\u2013376","journal-title":"World Wide Web"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-019-00715-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-019-00715-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-019-00715-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T00:29:56Z","timestamp":1585182596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-019-00715-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,27]]},"references-count":19,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["715"],"URL":"https:\/\/doi.org\/10.1007\/s00607-019-00715-6","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2019,3,27]]},"assertion":[{"value":"16 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}