{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:13:47Z","timestamp":1775913227137,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:00:00Z","timestamp":1622851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:00:00Z","timestamp":1622851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61832017"],"award-info":[{"award-number":["No. 61832017"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61972401"],"award-info":[{"award-number":["No. 61972401"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61932001"],"award-info":[{"award-number":["No. 61932001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61932004"],"award-info":[{"award-number":["No. 61932004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61622202"],"award-info":[{"award-number":["No. 61622202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Outstanding Young Scientist Program","award":["NO. BJJWZYJH012019100020098"],"award-info":[{"award-number":["NO. BJJWZYJH012019100020098"]}]},{"name":"the Fundamental Research Funds for the Central Universities and the Research Funds of Renmin University of China","award":["18XNLG21"],"award-info":[{"award-number":["18XNLG21"]}]},{"name":"FRFCU","award":["No. N181605012"],"award-info":[{"award-number":["No. N181605012"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. U1711261,"],"award-info":[{"award-number":["No. U1711261,"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00778-021-00672-7","type":"journal-article","created":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T19:02:34Z","timestamp":1622919754000},"page":"989-1015","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["ExactSim: benchmarking single-source SimRank algorithms with high-precision ground truths"],"prefix":"10.1007","volume":"30","author":[{"given":"Hanzhi","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhewei","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji-Rong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,5]]},"reference":[{"key":"672_CR1","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.cpc.2015.05.028","volume":"196","author":"Rodrigo Aldecoa","year":"2015","unstructured":"Aldecoa, Rodrigo, Orsini, Chiara, Krioukov, Dmitri: Hyperbolic graph generator. Computer Phys. Commun. 196, 492\u2013496 (2015)","journal-title":"Computer Phys. Commun."},{"key":"672_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, Reid., Chung, Fan R.\u00a0K., Lang, Kevin\u00a0J.: Local graph partitioning using pagerank vectors. In FOCS, pp. 475\u2013486, (2006)","DOI":"10.1109\/FOCS.2006.44"},{"issue":"1","key":"672_CR3","first-page":"408","volume":"1","author":"Ioannis Antonellis","year":"2008","unstructured":"Antonellis, Ioannis, Molina, Hector Garcia, Chang, Chi Chao: Simrank++: query rewriting through link analysis of the click graph. PVLDB 1(1), 408\u2013421 (2008)","journal-title":"PVLDB"},{"issue":"3","key":"672_CR4","first-page":"173","volume":"4","author":"Bahman Bahmani","year":"2010","unstructured":"Bahmani, Bahman, Chowdhury, Abdur, Goel, Ashish: Fast incremental and personalized pagerank. VLDB 4(3), 173\u2013184 (2010)","journal-title":"VLDB"},{"issue":"1","key":"672_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/15427951.2006.10129115","volume":"3","author":"Fan R K Chung","year":"2006","unstructured":"Chung, Fan R.K., Lu, Lincoln: Concentration inequalities and martingale inequalities: a survey. Internet Math. 3(1), 79\u2013127 (2006)","journal-title":"Internet Math."},{"key":"672_CR6","doi-asserted-by":"crossref","unstructured":"Fogaras, Daniel., Racz, Balazs.: Scaling link-based similarity search. In: WWW, pp. 641\u2013650, (2005)","DOI":"10.1145\/1060745.1060839"},{"issue":"3","key":"672_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D\u00e1niel Fogaras","year":"2005","unstructured":"Fogaras, D\u00e1niel, R\u00e1cz, Bal\u00e1zs, Csalog\u00e1ny, K\u00e1roly, Sarl\u00f3s, Tam\u00e1s: Towards scaling fully personalized pagerank: algorithms, lower bounds, and experiments. Internet Math. 2(3), 333\u2013358 (2005)","journal-title":"Internet Math."},{"key":"672_CR8","doi-asserted-by":"crossref","unstructured":"Fujiwara, Yuichiro., Nakatsuji, Makoto., Shiokawa, Hiroaki., Onizuka, Makoto.: Efficient search algorithm for simrank. In: ICDE, pp. 589\u2013600, (2013)","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"672_CR9","doi-asserted-by":"crossref","unstructured":"He, Guoming., Feng, Haijun., Li, Cuiping., Chen, Hong.: Parallel simrank computation on large graphs with iterative aggregation. In: KDD, pp. 543\u2013552, (2010)","DOI":"10.1145\/1835804.1835874"},{"key":"672_CR10","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: SIGKDD, pp. 538\u2013543, (2002)","DOI":"10.1145\/775047.775126"},{"issue":"9","key":"672_CR11","first-page":"937","volume":"10","author":"M Jiang","year":"2017","unstructured":"Jiang, M., Fu, A.W.C., Wong, R.C.W.: Reads: a random walk approach for efficient and accurate dynamic simrank. PPVLDB 10(9), 937\u2013948 (2017)","journal-title":"PPVLDB"},{"issue":"3","key":"672_CR12","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"Dmitri Krioukov","year":"2010","unstructured":"Krioukov, Dmitri, Papadopoulos, Fragkiskos, Kitsak, Maksim, Vahdat, Amin, Bogun\u00e1, Mari\u00e1n: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)","journal-title":"Phys. Rev. E"},{"key":"672_CR13","doi-asserted-by":"crossref","unstructured":"Kusumoto, M., Maehara, T., Kawarabayashi, K-I.: Scalable similarity search for simrank. In: SIGMOD, pp. 325\u2013336, (2014)","DOI":"10.1145\/2588555.2610526"},{"key":"672_CR14","doi-asserted-by":"crossref","unstructured":"Lee, P., Lakshmanan, LVS., Yu, JX.: On top-k structural similarity search. In: ICDE, pp. 774\u2013785, (2012)","DOI":"10.1109\/ICDE.2012.109"},{"key":"672_CR15","unstructured":"Leskovec, J, Chakrabarti, D, Kleinberg, J, Faloutsos, C, Ghahramani, Z: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11(2), (2010)"},{"key":"672_CR16","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":"672_CR17","doi-asserted-by":"crossref","unstructured":"Li, L., Li, C., Chen, H., Du, X.: Mapreduce-based simrank computation and its application in social recommender system. In: 2013 IEEE International Congress on Big Data, pp. 133\u2013140. IEEE, (2013)","DOI":"10.1109\/BigData.Congress.2013.26"},{"issue":"1","key":"672_CR18","first-page":"24","volume":"9","author":"Zhenguo Li","year":"2015","unstructured":"Li, Zhenguo, Fang, Yixiang, Liu, Qin, Cheng, Jiefeng, Cheng, Reynold, Lui, John: Walking in the cloud: parallel simrank at scale. PVLDB 9(1), 24\u201335 (2015)","journal-title":"PVLDB"},{"issue":"1","key":"672_CR19","first-page":"141","volume":"32","author":"Zhenjiang Lin","year":"2012","unstructured":"Lin, Zhenjiang, Lyu, Michael R., King, Irwin: Matchsim: a novel similarity measure based on maximum neighborhood matching. KAIS 32(1), 141\u2013166 (2012)","journal-title":"KAIS"},{"issue":"2\u20133","key":"672_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/15427951.2007.10129293","volume":"4","author":"N Litvak","year":"2007","unstructured":"Litvak, N., Scheinhardt, W.R.W., Volkovich, Y.: In-degree and pagerank: why do they follow similar power laws? Internet Math. 4(2\u20133), 175\u2013198 (2007)","journal-title":"Internet Math."},{"issue":"1","key":"672_CR21","first-page":"14","volume":"11","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Zheng, B., He, X., Wei, Z., Xiao, X., Zheng, K., Jiaheng, L.: Probesim: scalable single-source and top-k simrank computations on dynamic graphs. PVLDB 11(1), 14\u201326 (2017)","journal-title":"PVLDB"},{"issue":"1","key":"672_CR22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00778-009-0168-8","volume":"19","author":"D Lizorkin","year":"2010","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M., Turdakov, D.: Accuracy estimate and optimization techniques for simrank computation. VLDB J. 19(1), 45\u201366 (2010)","journal-title":"VLDB J."},{"issue":"1","key":"672_CR23","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00778-009-0168-8","volume":"19","author":"D Lizorkin","year":"2010","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M.N., Turdakov, D.: Accuracy estimate and optimization techniques for simrank computation. VLDB J. 19(1), 45\u201366 (2010)","journal-title":"VLDB J."},{"issue":"6","key":"672_CR24","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"Linyuan L\u00fc","year":"2011","unstructured":"L\u00fc, Linyuan, Zhou, Tao: Link prediction in complex networks: a survey. Phys. A: Stat. Mech. Appl. 390(6), 1150\u20131170 (2011)","journal-title":"Phys. A: Stat. Mech. Appl."},{"key":"672_CR25","doi-asserted-by":"crossref","unstructured":"Luo, X.,\u00a0Gao, J.,\u00a0Zhou, C., Yu, J.\u00a0X.: Uniwalk: Unidirectional random walk based scalable simrank computation over large graph. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 325\u2013336, (2017)","DOI":"10.1109\/ICDE.2017.92"},{"key":"672_CR26","doi-asserted-by":"crossref","unstructured":"Maehara, T., Kusumoto, M., Kawarabayashi, K.: Efficient simrank computation via linearization. CoRR, abs\/1411.7228, (2014)","DOI":"10.1145\/2623330.2623696"},{"key":"672_CR27","doi-asserted-by":"crossref","unstructured":"Maehara, T., Kusumoto, M., Kawarabayashi, K.: Scalable simrank join algorithm. In: ICDE, pp. 603\u2013614, (2015)","DOI":"10.1109\/ICDE.2015.7113318"},{"key":"672_CR28","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. (1999)"},{"issue":"8","key":"672_CR29","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"},{"issue":"3","key":"672_CR30","first-page":"317","volume":"8","author":"W Tao","year":"2014","unstructured":"Tao, W., Minghe, Y., Li, G.: Efficient top-k simrank-based similarity join. PVLDB 8(3), 317\u2013328 (2014)","journal-title":"PVLDB"},{"key":"672_CR31","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":"672_CR32","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., Mottin, D., Karras, P., M\u00fcller, E.: Verse: Versatile graph embeddings from similarity measures. In: WWW, pp. 539\u2013548. International World Wide Web Conferences Steering Committee, (2018)","DOI":"10.1145\/3178876.3186120"},{"key":"672_CR33","doi-asserted-by":"crossref","unstructured":"Wang, H., Wei, Z.,\u00a0Yuan, Y., Du, X., Wen, J.: Exact single-source simrank computation on large graphs. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 653\u2013663, (2020)","DOI":"10.1145\/3318464.3389781"},{"key":"672_CR34","doi-asserted-by":"crossref","unstructured":"Wang, Y, Che, Y, Lian, X, Chen, L, Luo, Q: Fast and accurate simrank computation via forward local push and its parallelization. In: IEEE Transactions on Knowledge and Data Engineering (2020)","DOI":"10.1109\/TKDE.2020.2976988"},{"issue":"1","key":"672_CR35","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00778-018-0521-x","volume":"28","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Chen, L., Che, Y., Luo, Q.: Accelerating pairwise simrank estimation over static and dynamic graphs. VLDB J. 28(1), 99\u2013122 (2019)","journal-title":"VLDB J."},{"key":"672_CR36","doi-asserted-by":"crossref","unstructured":"Wei, Z., He, X., Xiao, X., Wang, S.,\u00a0Liu, Y., Du, X., Wen, J.: Prsim: sublinear time simrank computation on large power-law graphs. In: SIGMOD, pp. 1042\u20131059. ACM, (2019)","DOI":"10.1145\/3299869.3319873"},{"key":"672_CR37","doi-asserted-by":"crossref","unstructured":"Xi, W., Fox, EA., Fan, W., Zhang, B., Chen, Z., Yan, J., Zhuang, D.: Simfusion: measuring similarity using unified relationship matrix. In: SIGIR, pp. 130\u2013137. ACM, (2005)","DOI":"10.1145\/1076034.1076059"},{"key":"672_CR38","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"},{"issue":"1","key":"672_CR39","first-page":"13","volume":"7","author":"Y Weiren","year":"2013","unstructured":"Weiren, Y., Lin, X., Zhang, W., Chang, L., Pei, J.: More is simpler: effectively and efficiently assessing node-pair similarities based on hyperlinks. PVLDB 7(1), 13\u201324 (2013)","journal-title":"PVLDB"},{"key":"672_CR40","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, J.: Gauging correct relative rankings for similarity search. In: CIKM, pp. 1791\u20131794, (2015)","DOI":"10.1145\/2806416.2806610"},{"issue":"5","key":"672_CR41","first-page":"569","volume":"8","author":"Y Weiren","year":"2015","unstructured":"Weiren, Y., McCann, J.A.: Efficient partial-pairs simrank search for large networks. PVLDB 8(5), 569\u2013580 (2015)","journal-title":"PVLDB"},{"issue":"5","key":"672_CR42","doi-asserted-by":"publisher","first-page":"569","DOI":"10.14778\/2735479.2735489","volume":"8","author":"W Yu","year":"2015","unstructured":"Yu, W., McCann, J.A.: Efficient partial-pairs simrank search on large networks. Proc. VLDB Endow. 8(5), 569\u2013580 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"672_CR43","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, JA.: High quality graph-based similarity search. In: SIGIR, pp. 83\u201392, (2015)","DOI":"10.1145\/2766462.2767720"},{"issue":"3","key":"672_CR44","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s11280-010-0100-6","volume":"15","author":"Y Weiren","year":"2012","unstructured":"Weiren, Y., Zhang, W., Lin, X., Zhang, Q., Le, J.: A space and time efficient algorithm for simrank computation. World Wide Web 15(3), 327\u2013353 (2012)","journal-title":"World Wide Web"},{"key":"672_CR45","doi-asserted-by":"crossref","unstructured":"Zhang, J., Tang, J., Ma, C., Tong, H., Jing, Y., Li, J.: Panther: Fast top-k similarity search on large networks. In: SIGKDD, pp. 1445\u20131454. ACM, (2015)","DOI":"10.1145\/2783258.2783267"},{"key":"672_CR46","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: CIKM, pp. 553\u2013562. ACM, (2009)","DOI":"10.1145\/1645953.1646025"},{"key":"672_CR47","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: CIKM, pp. 553\u2013562, (2009)","DOI":"10.1145\/1645953.1646025"},{"issue":"7","key":"672_CR48","first-page":"493","volume":"6","author":"W Zheng","year":"2013","unstructured":"Zheng, W., Zou, L., Feng, Y., Chen, L., Zhao, D.: Efficient simrank-based similarity join over large graphs. PVLDB 6(7), 493\u2013504 (2013)","journal-title":"PVLDB"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00672-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00672-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00672-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T01:29:25Z","timestamp":1672363765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00672-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,5]]},"references-count":48,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["672"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00672-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,5]]},"assertion":[{"value":"4 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}