{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:59:42Z","timestamp":1760385582953,"version":"3.41.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T00:00:00Z","timestamp":1511308800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Australian Research Council Discovery Grant","award":["DP150102728"],"award-info":[{"award-number":["DP150102728"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s00778-017-0488-z","type":"journal-article","created":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T12:36:18Z","timestamp":1511354178000},"page":"79-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Dynamical SimRank search on time-varying networks"],"prefix":"10.1007","volume":"27","author":[{"given":"Weiren","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julie A.","family":"McCann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,22]]},"reference":[{"issue":"3","key":"488_CR1","first-page":"173","volume":"4","author":"B Bahmani","year":"2010","unstructured":"Bahmani, B., Chowdhury, A., Goel, A.: Fast incremental and personalized PageRank. PVLDB 4(3), 173\u2013184 (2010)","journal-title":"PVLDB"},{"key":"488_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P Berkhin","year":"2005","unstructured":"Berkhin, P.: Survey: a survey on PageRank computing. Internet Math. 2, 73\u2013120 (2005)","journal-title":"Internet Math."},{"key":"488_CR3","doi-asserted-by":"crossref","unstructured":"Desikan, P.K., Pathak, N., Srivastava, J., Kumar, V.: Incremental PageRank computation on evolving graphs. In: WWW, pp. 1094\u20131095 (2005)","DOI":"10.1145\/1062745.1062885"},{"key":"488_CR4","doi-asserted-by":"crossref","unstructured":"Fogaras, D., R\u00e1cz, B.: Scaling link-based similarity search. In: WWW, pp. 641\u2013650 (2005)","DOI":"10.1145\/1060745.1060839"},{"key":"488_CR5","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/TKDE.2007.1008","volume":"19","author":"D Fogaras","year":"2007","unstructured":"Fogaras, D., R\u00e1cz, B.: Practical algorithms and lower bounds for similarity search in massive graphs. IEEE Trans. Knowl. Data Eng. 19, 585\u2013598 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"488_CR6","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Onizuka, M.: Efficient search algorithm for SimRank. In: ICDE, pp. 589\u2013600 (2013)","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"488_CR7","doi-asserted-by":"crossref","unstructured":"Garg, S., Gupta, T., Carlsson, N., Mahanti, A.: Evolution of an online social aggregation network: an empirical study. In: Internet Measurement Conference, pp. 315\u2013321 (2009)","DOI":"10.1145\/1644893.1644931"},{"key":"488_CR8","doi-asserted-by":"crossref","unstructured":"He, G., Feng, H., Li, C., Chen, H.: Parallel SimRank computation on large graphs with iterative aggregation. In: KDD, pp. 543\u2013552 (2010)","DOI":"10.1145\/1835804.1835874"},{"key":"488_CR9","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In: KDD, pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"issue":"9","key":"488_CR10","first-page":"937","volume":"10","author":"M Jiang","year":"2017","unstructured":"Jiang, M., Fu, A.W., Wong, R.C., Wang, K.: READS: a random walk approach for efficient and accurate dynamic SimRank. PVLDB 10(9), 937\u2013948 (2017)","journal-title":"PVLDB"},{"key":"488_CR11","doi-asserted-by":"crossref","unstructured":"Kusumoto, M., Maehara, T., Kawarabayashi, K.: Scalable similarity search for SimRank. In: SIGMOD, pp. 325\u2013336 (2014)","DOI":"10.1145\/2588555.2610526"},{"key":"488_CR12","doi-asserted-by":"crossref","unstructured":"Lee, P., Lakshmanan, L.V., Yu, J.X.: On top- $$k$$ k structural similarity search. In: ICDE, pp. 774\u2013785 (2012)","DOI":"10.1109\/ICDE.2012.109"},{"key":"488_CR13","doi-asserted-by":"crossref","unstructured":"Li, C., Han, J., He, G., Jin, X., Sun, Y., Yu, Y., Wu, T.: Fast computation of SimRank for static and dynamic information networks. In: EDBT, pp. 465\u2013476 (2010)","DOI":"10.1145\/1739041.1739098"},{"key":"488_CR14","doi-asserted-by":"crossref","unstructured":"Li, P., Liu, H., Yu, J.X., He, J., Du, X.: Fast single-pair SimRank computation. In: SDM, pp. 571\u2013582 (2010)","DOI":"10.1137\/1.9781611972801.50"},{"issue":"1","key":"488_CR15","first-page":"24","volume":"9","author":"Z Li","year":"2015","unstructured":"Li, Z., Fang, Y., Liu, Q., Cheng, J., Cheng, R., Lui, J.C.S.: Walking in the cloud: parallel SimRank at scale. PVLDB 9(1), 24\u201335 (2015)","journal-title":"PVLDB"},{"key":"488_CR16","first-page":"422","volume":"1","author":"D Lizorkin","year":"2008","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M.N., Turdakov, D.: Accuracy estimate and optimization techniques for SimRank computation. PVLDB 1, 422\u2013433 (2008)","journal-title":"PVLDB"},{"key":"488_CR17","doi-asserted-by":"crossref","unstructured":"Ntoulas, A., Cho, J., Olston, C.: What\u2019s new on the web? The evolution of the web from a search engine perspective. In: WWW, pp. 1\u201312 (2004)","DOI":"10.1145\/988672.988674"},{"key":"488_CR18","doi-asserted-by":"crossref","unstructured":"Rothe, S., Sch\u00fctze, H.: CoSimRank: A flexible & efficient graph-theoretic similarity measure. In: ACL, pp. 1392\u20131402 (2014)","DOI":"10.3115\/v1\/P14-1131"},{"key":"488_CR19","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1970392.1970397","volume":"58","author":"AD Sarma","year":"2011","unstructured":"Sarma, A.D., Gollapudi, S., Panigrahy, R.: Estimating PageRank on graph streams. J. ACM 58, 13 (2011)","journal-title":"J. ACM"},{"issue":"8","key":"488_CR20","first-page":"838","volume":"8","author":"Y Shao","year":"2015","unstructured":"Shao, Y., Cui, B., Chen, L., Liu, M., Xie, X.: An efficient similarity search framework for SimRank over large dynamic graphs. PVLDB 8(8), 838\u2013849 (2015)","journal-title":"PVLDB"},{"key":"488_CR21","first-page":"992","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: PathSim: meta path-based top- $$k$$ k similarity search in heterogeneous information networks. PVLDB 4, 992\u20131003 (2011)","journal-title":"PVLDB"},{"issue":"3","key":"488_CR22","first-page":"317","volume":"8","author":"W Tao","year":"2014","unstructured":"Tao, W., Yu, M., Li, G.: Efficient top- $$k$$ k SimRank-based similarity join. PVLDB 8(3), 317\u2013328 (2014)","journal-title":"PVLDB"},{"key":"488_CR23","doi-asserted-by":"crossref","unstructured":"Tian, B., Xiao, X.: SLING: a near-optimal index structure for SimRank. In: SIGMOD, pp. 1859\u20131874 (2016)","DOI":"10.1145\/2882903.2915243"},{"key":"488_CR24","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W.: Towards efficient SimRank computation on large networks. In: ICDE, pp. 601\u2013612 (2013)","DOI":"10.1109\/ICDE.2013.6544859"},{"key":"488_CR25","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W.: Fast incremental SimRank on link-evolving graphs. In: ICDE, pp. 304\u2013315 (2014)","DOI":"10.1109\/ICDE.2014.6816660"},{"key":"488_CR26","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, J.A.: Sig-SR: SimRank search over singular graphs. In: SIGIR, pp. 859\u2013862 (2014)","DOI":"10.1145\/2600428.2609459"},{"issue":"5","key":"488_CR27","first-page":"569","volume":"8","author":"W Yu","year":"2015","unstructured":"Yu, W., McCann, J.A.: Efficient partial-pairs SimRank search for large networks. PVLDB 8(5), 569\u2013580 (2015)","journal-title":"PVLDB"},{"key":"488_CR28","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, J.A.: High quality graph-based similarity retrieval. In: SIGIR, pp. 83\u201392 (2015)","DOI":"10.1145\/2766462.2767720"},{"key":"488_CR29","doi-asserted-by":"crossref","first-page":"1810","DOI":"10.1109\/TKDE.2014.2339828","volume":"27","author":"W Yu","year":"2015","unstructured":"Yu, W., Lin, X., Zhang, W., McCann, J.A.: Fast all-pairs SimRank assessment on large graphs and bipartite domains. IEEE Trans. Knowl. Data Eng. 27, 1810\u20131823 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"488_CR30","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, J.A.: Gauging correct relative rankings for similarity search. In: CIKM, pp. 1791\u20131794 (2015)","DOI":"10.1145\/2806416.2806610"},{"key":"488_CR31","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, J.A.: Random walk with restart over dynamic graphs. In: ICDM, pp. 589\u2013598 (2016)","DOI":"10.1109\/ICDM.2016.0070"},{"key":"488_CR32","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W., McCann, J.A.: Dynamical SimRank search on time-varying networks. Technical report, arXiv:1711.00121 (2017)","DOI":"10.1007\/s00778-017-0488-z"},{"issue":"5","key":"488_CR33","first-page":"601","volume":"10","author":"Z Zhang","year":"2017","unstructured":"Zhang, Z., Shao, Y., Cui, B., Zhang, C.: An experimental evaluation of SimRank-based similarity search algorithms. PVLDB 10(5), 601\u2013612 (2017)","journal-title":"PVLDB"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0488-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0488-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0488-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T11:39:52Z","timestamp":1751024392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0488-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,22]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["488"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0488-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2017,11,22]]}}}