{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:47:18Z","timestamp":1779896838473,"version":"3.53.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:00:00Z","timestamp":1505347200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10619-017-7207-z","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T20:25:07Z","timestamp":1505420707000},"page":"249-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["HiNode: an asymptotically space-optimal storage model for historical queries on graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Andreas","family":"Kosmatopoulos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anastasios","family":"Gounaris","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spyros","family":"Sioutas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evaggelia","family":"Pitoura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,9,14]]},"reference":[{"issue":"9","key":"7207_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"issue":"2","key":"7207_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/2601438","volume":"8","author":"NK Ahmed","year":"2014","unstructured":"Ahmed, N.K., Neville, J., Kompella, R.: Network sampling: from static to streaming graphs. ACM Trans. Knowl. Discov. Data 8(2), 7 (2014)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"5439","key":"7207_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"7207_CR4","unstructured":"Cassovary. \u201cbig graph\u201d\u00a0processing library. https:\/\/github.com\/twitter\/cassovary"},{"key":"7207_CR5","doi-asserted-by":"crossref","unstructured":"Brisaboa, N.R., Caro, D., Fari\u00f1a, A., Rodr\u00edguez, M.A.: A compressed suffix-array strategy for temporal-graph indexing. In: SPIRE, pp. 77\u201388 (2014)","DOI":"10.1007\/978-3-319-11918-2_8"},{"key":"7207_CR6","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Katajainen, J.: Worst-case external-memory priority queues. In: SWAT, pp. 107\u2013118 (1998)","DOI":"10.1007\/BFb0054359"},{"key":"7207_CR7","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Tsakalidis, K., Sioutas, S., Tsichlas, K.: Fully persistent B-trees. In: SODA, pp. 602\u2013614 (2012)","DOI":"10.1137\/1.9781611973099.51"},{"key":"7207_CR8","doi-asserted-by":"crossref","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":"7207_CR9","doi-asserted-by":"crossref","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. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"7207_CR10","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. I. Publ. Math. Debr. 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debr."},{"issue":"2","key":"7207_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00778-015-0416-z","volume":"25","author":"J Gao","year":"2016","unstructured":"Gao, J., Zhou, C., Yu, J.X.: Toward continuous pattern detection over evolving large graph with snapshot isolation. VLDB J. 25(2), 269\u2013290 (2016)","journal-title":"VLDB J."},{"issue":"2","key":"7207_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/980972.980992","volume":"5","author":"J Gehrke","year":"2003","unstructured":"Gehrke, J., Ginsparg, P., Kleinberg, J.M.: Overview of the 2003 KDD cup. SIGKDD Explor. 5(2), 149\u2013151 (2003)","journal-title":"SIGKDD Explor."},{"key":"7207_CR13","unstructured":"Giraph, A. http:\/\/giraph.apache.org\/"},{"key":"7207_CR14","unstructured":"Hu, P., Lau, W.C.: A survey and taxonomy of graph sampling. CoRR. arXiv:1308.5865 (2013)"},{"key":"7207_CR15","doi-asserted-by":"crossref","unstructured":"Huo, W., Tsotras, V.J.: Efficient temporal shortest path queries on evolving social graphs. In: SSDBM, pp. 38:1\u201338:4 (2014)","DOI":"10.1145\/2618243.2618282"},{"key":"7207_CR16","doi-asserted-by":"crossref","unstructured":"Kang, U., Tong, H., Sun, J., Lin, C., Faloutsos, C.: GBASE: a scalable and general graph management system. In: SIGKDD, pp. 1091\u20131099 (2011)","DOI":"10.1145\/2020408.2020580"},{"issue":"2","key":"7207_CR17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10115-010-0305-0","volume":"27","author":"U Kang","year":"2011","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: PEGASUS: mining peta-scale graphs. Knowl. Inf. Syst. 27(2), 303\u2013325 (2011)","journal-title":"Knowl. Inf. Syst."},{"key":"7207_CR18","doi-asserted-by":"crossref","unstructured":"Khurana, U., Deshpande, A.: Efficient snapshot retrieval over historical graph data. In: ICDE, pp .997\u20131008 (2013)","DOI":"10.1109\/ICDE.2013.6544892"},{"key":"7207_CR19","unstructured":"Khurana, U., Deshpande, A.: Storing and analyzing historical graph data at scale. In: EDBT, pp. 77\u201388 (2016)"},{"key":"7207_CR20","unstructured":"Koloniari, G., Souravlias, D., Pitoura, E.: On graph deltas for historical queries. In: WOSS (2012)"},{"key":"7207_CR21","doi-asserted-by":"crossref","unstructured":"Kosmatopoulos, A., Giannakopoulou, K., Papadopoulos, A.N., Tsichlas, K.: An overview of methods for handling evolving graph sequences. In: ALGOCLOUD, pp. 181\u2013192 (2015)","DOI":"10.1007\/978-3-319-29919-8_14"},{"issue":"4","key":"7207_CR22","doi-asserted-by":"crossref","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":"7207_CR23","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"7207_CR24","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: SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"7207_CR25","doi-asserted-by":"crossref","unstructured":"Mondal, J., Deshpande, A.: Managing large dynamic graphs efficiently. In: SIGMOD, pp. 145\u2013156 (2012)","DOI":"10.1145\/2213836.2213854"},{"key":"7207_CR26","doi-asserted-by":"crossref","unstructured":"Pagh, R.: Basic external memory data structures. In: Algorithms for Memory Hierarchies, pp. 14\u201335 (2002)","DOI":"10.1007\/3-540-36574-5_2"},{"issue":"11","key":"7207_CR27","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":"7207_CR28","doi-asserted-by":"crossref","unstructured":"Ribeiro, B.F., Towsley, D.: On the estimation accuracy of degree distributions from graph sampling. In: CDC, pp. 5240\u20135247 (2012)","DOI":"10.1109\/CDC.2012.6425857"},{"issue":"2","key":"7207_CR29","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/319806.319816","volume":"31","author":"B Salzberg","year":"1999","unstructured":"Salzberg, B., Tsotras, V.J.: Comparison of access methods for time-evolving data. ACM Comput. Surv. 31(2), 158\u2013221 (1999)","journal-title":"ACM Comput. Surv."},{"key":"7207_CR30","unstructured":"Semertzidis, K., Pitoura, E., Lillis, K.: Timereach: historical reachability queries on evolving graphs. In: EDBT, pp. 121\u2013132 (2015)"},{"key":"7207_CR31","doi-asserted-by":"crossref","unstructured":"Shao, B., Wang, H., Li, Y.: Trinity: a distributed graph engine on a memory cloud. In: SIGMOD, pp. 505\u2013516 (2013)","DOI":"10.1145\/2463676.2467799"},{"key":"7207_CR32","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* graph database system. In: ICDE, pp. 1356\u20131359 (2013)","DOI":"10.1109\/ICDE.2013.6544943"},{"issue":"3","key":"7207_CR33","doi-asserted-by":"crossref","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"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-017-7207-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-017-7207-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-017-7207-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T22:07:06Z","timestamp":1693001226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-017-7207-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,14]]},"references-count":33,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["7207"],"URL":"https:\/\/doi.org\/10.1007\/s10619-017-7207-z","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,14]]}}}