{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:06:33Z","timestamp":1759190793352,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T00:00:00Z","timestamp":1537488000000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00778-018-0521-x","type":"journal-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T16:40:30Z","timestamp":1537548030000},"page":"99-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Accelerating pairwise SimRank estimation over static and dynamic graphs"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8618-9806","authenticated-orcid":false,"given":"Yue","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulin","family":"Che","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiong","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,21]]},"reference":[{"key":"521_CR1","doi-asserted-by":"publisher","unstructured":"Abbassi, Z., Mirrokni, V.S.: A recommender system based on local random walks and spectral methods. In: WebKDD\/SNA-KDD (2007). \n                    https:\/\/doi.org\/10.1145\/1348549.1348561","DOI":"10.1145\/1348549.1348561"},{"key":"521_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"521_CR3","unstructured":"Antonellis, I., Garcia-Molina, H., Chang, C.: Simrank++: query rewriting through link analysis of the click graph. PVLDB 1(1), 408\u2013421, (2008). \n                    http:\/\/www.vldb.org\/pvldb\/1\/1453903.pdf"},{"key":"521_CR4","doi-asserted-by":"crossref","unstructured":"Fogaras, D., R\u00e1cz, B.: Scaling link-based similarity search. In: WWW (2005)","DOI":"10.1145\/1060745.1060839"},{"key":"521_CR5","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Onizuka, M.: Efficient search algorithm for SimRank. In: ICDE (2013)","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"521_CR6","doi-asserted-by":"publisher","unstructured":"He, G., Feng, H., Li, C., Chen, H.: Parallel SimRank computation on large graphs with iterative aggregation. In: KDD (2010). \n                    https:\/\/doi.org\/10.1145\/1835804.1835874","DOI":"10.1145\/1835804.1835874"},{"key":"521_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.is.2013.12.008","volume":"42","author":"J He","year":"2014","unstructured":"He, J., Liu, H., Yu, J.X., Li, P., He, W., Du, X.: Assessing single-pair similarity over graphs by aggregating first-meeting probabilities. Inf. Syst. 42, 107\u2013122 (2014). \n                    https:\/\/doi.org\/10.1016\/j.is.2013.12.008","journal-title":"Inf. Syst."},{"key":"521_CR8","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963). \n                    http:\/\/www.jstor.org\/stable\/2282952"},{"key":"521_CR9","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: KDD (2002)","DOI":"10.1145\/775047.775126"},{"key":"521_CR10","doi-asserted-by":"publisher","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: Proceedings of the Twelfth International World Wide Web Conference, WWW 2003, Budapest, Hungary, 20\u201324 May 2003, pp. 271\u2013279 (2003). \n                    https:\/\/doi.org\/10.1145\/775152.775191","DOI":"10.1145\/775152.775191"},{"issue":"9","key":"521_CR11","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":"521_CR12","doi-asserted-by":"publisher","unstructured":"Kusumoto, M., Maehara, T., Kawarabayashi, K: Scalable similarity search for SimRank. In: SIGMOD (2014). \n                    https:\/\/doi.org\/10.1145\/2588555.2610526","DOI":"10.1145\/2588555.2610526"},{"key":"521_CR13","doi-asserted-by":"publisher","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 (2010a). \n                    https:\/\/doi.org\/10.1145\/1739041.1739098","DOI":"10.1145\/1739041.1739098"},{"key":"521_CR14","doi-asserted-by":"crossref","unstructured":"Li, P., Liu, H., Yu, J.X., He, J., Du, X.: Fast single-pair SimRank computation. In: Proceedings of the 2010 SIAM International Conference on Data Mining, SIAM, pp. 571\u2013582 (2010b)","DOI":"10.1137\/1.9781611972801.50"},{"issue":"1","key":"521_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"},{"issue":"7","key":"521_CR16","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Assoc. Inf. Sci. Technol. 58(7), 1019\u20131031 (2007)","journal-title":"J. Assoc. Inf. Sci. Technol."},{"key":"521_CR17","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zheng, B., He, X., Wei, Z., Xiao, X., Zheng, K., Lu, J.: Probesim: scalable single-source and top-k SimRank computations on dynamic graphs. PVLDB 11(1), 14\u201326 (2017). \n                    http:\/\/www.vldb.org\/pvldb\/vol11\/p14-liu.pdf","DOI":"10.14778\/3151113.3151115"},{"issue":"1","key":"521_CR18","first-page":"422","volume":"1","author":"D Lizorkin","year":"2008","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M., Turdakov, D.: Accuracy estimate and optimization techniques for SimRank computation. VLDB 1(1), 422\u2013433 (2008)","journal-title":"VLDB"},{"key":"521_CR19","doi-asserted-by":"publisher","unstructured":"Lofgren, P., Banerjee, S., Goel, A.: Personalized PageRank estimation and search: a bidirectional approach. In: Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, ACM, New York (WSDM \u201916), pp. 163\u2013172 (2016). \n                    https:\/\/doi.org\/10.1145\/2835776.2835823","DOI":"10.1145\/2835776.2835823"},{"key":"521_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2626282","author":"J Lu","year":"2017","unstructured":"Lu, J., Gong, Z., Lin, X.: A novel and fast SimRank algorithm. IEEE Trans. Knowl. Data Eng. (2017). \n                    https:\/\/doi.org\/10.1109\/TKDE.2016.2626282","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"521_CR21","unstructured":"Maehara, T., Kusumoto, M., Kawarabayashi, K.: Efficient SimRank computation via linearization (2014). CoRR \n                    arXiv:1411.7228"},{"key":"521_CR22","doi-asserted-by":"publisher","unstructured":"Mislove, A., Koppula, H.S., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Growth of the flickr social network. In: Proceedings of the First Workshop on Online Social Networks (WOSN 2008), Seattle, 17\u201322 Aug 2008, pp. 25\u201330 (2008). \n                    https:\/\/doi.org\/10.1145\/1397735.1397742","DOI":"10.1145\/1397735.1397742"},{"issue":"8","key":"521_CR23","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":"2","key":"521_CR24","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2207243.2207252","volume":"13","author":"N Spirin","year":"2012","unstructured":"Spirin, N., Han, J.: Survey on web spam detection: principles and algorithms. SIGKDD Explor. Newsl. 13(2), 50\u201364 (2012)","journal-title":"SIGKDD Explor. Newsl."},{"key":"521_CR25","unstructured":"Tao, W., Yu, M., Li, G.: Efficient top-k SimRank-based similarity join. PVLDB 8(3):317\u2013328, (2014). \n                    http:\/\/www.vldb.org\/pvldb\/vol8\/p317-tao.pdf"},{"key":"521_CR26","doi-asserted-by":"publisher","unstructured":"Tian, B., Xiao, X.: Sling: A near-optimal index structure for SimRank. SIGMOD (2016).\n                    https:\/\/doi.org\/10.1145\/2882903.2915243","DOI":"10.1145\/2882903.2915243"},{"key":"521_CR27","doi-asserted-by":"crossref","unstructured":"Wang, Y., Lian, X., Chen, L.: Efficient SimRank tracking in dynamic graphs. In: ICDE (2018)","DOI":"10.1109\/ICDE.2018.00056"},{"key":"521_CR28","unstructured":"Yin, X., Han, J., Yu, P.S.: Linkclus: efficient clustering via heterogeneous semantic links. In: VLDB (2006)"},{"key":"521_CR29","unstructured":"Yoon, M., Jin, W., Kang, U.: Fast and accurate random walk with restart on dynamic graphs with guarantees (2017). CoRR \n                    arXiv:1712.00595"},{"issue":"5","key":"521_CR30","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":"521_CR31","doi-asserted-by":"publisher","unstructured":"Yu, W., Zhang, W., Lin, X., Zhang, Q., Le, J.: A space and time efficient algorithm for simrank computation. WWW 15(3) (2012). \n                    https:\/\/doi.org\/10.1007\/s11280-010-0100-6","DOI":"10.1007\/s11280-010-0100-6"},{"key":"521_CR32","doi-asserted-by":"publisher","unstructured":"Yu, W., Lin, X., Zhang, W.: Towards efficient SimRank computation on large networks. In: ICDE, pp. 601\u2013612 (2013a). \n                    https:\/\/doi.org\/10.1109\/ICDE.2013.6544859","DOI":"10.1109\/ICDE.2013.6544859"},{"issue":"1","key":"521_CR33","first-page":"13","volume":"7","author":"W Yu","year":"2013","unstructured":"Yu, W., 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 (2013b)","journal-title":"PVLDB"},{"key":"521_CR34","doi-asserted-by":"publisher","unstructured":"Yu, W., Lin, X., Zhang, W.: Fast incremental SimRank on link-evolving graphs. In: ICDE, pp. 304\u2013315 (2014). \n                    https:\/\/doi.org\/10.1109\/ICDE.2014.6816660","DOI":"10.1109\/ICDE.2014.6816660"},{"issue":"1","key":"521_CR35","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00778-017-0488-z","volume":"27","author":"W Yu","year":"2018","unstructured":"Yu, W., Lin, X., Zhang, W., McCann, J.A.: Dynamical simrank search on time-varying networks. VLDB J. 27(1), 79\u2013104 (2018). \n                    https:\/\/doi.org\/10.1007\/s00778-017-0488-z","journal-title":"VLDB J."},{"key":"521_CR36","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, ACM, pp. 553\u2013562 (2009)","DOI":"10.1145\/1645953.1646025"},{"issue":"3","key":"521_CR37","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/3083899","volume":"42","author":"W Zheng","year":"2017","unstructured":"Zheng, W., Zou, L., Chen, L., Zhao, D.: Efficient simrank-based similarity join. ACM Trans. Database Syst. 42(3), 16:1\u201316:37 (2017). \n                    https:\/\/doi.org\/10.1145\/3083899","journal-title":"ACM Trans. Database Syst."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-018-0521-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0521-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-018-0521-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T19:33:18Z","timestamp":1569007998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-018-0521-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,21]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["521"],"URL":"https:\/\/doi.org\/10.1007\/s00778-018-0521-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2018,9,21]]},"assertion":[{"value":"14 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}