{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:17:58Z","timestamp":1778807878208,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004853","name":"Chinese University of Hong Kong","doi-asserted-by":"publisher","award":["4055114"],"award-info":[{"award-number":["4055114"]}],"id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004853","name":"Chinese University of Hong Kong","doi-asserted-by":"publisher","award":["4930911"],"award-info":[{"award-number":["4930911"]}],"id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004853","name":"Chinese University of Hong Kong","doi-asserted-by":"publisher","award":["5501570"],"award-info":[{"award-number":["5501570"]}],"id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00778-019-00576-7","type":"journal-article","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T16:07:56Z","timestamp":1570550876000},"page":"923-940","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Parallelizing approximate single-source personalized PageRank queries on shared memory"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0823-5982","authenticated-orcid":false,"given":"Runhui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sibo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,8]]},"reference":[{"key":"576_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-77004-6_12","volume-title":"Algorithms and Models for the Web-Graph","author":"Reid Andersen","year":"2007","unstructured":"Andersen, R., Borgs, C., Chayes, J., Hopcraft, J., Mirrokni, V., Teng, S.-H.: Local computation of pagerank contributions. In: WAW, pp. 150\u2013165 (2007)"},{"key":"576_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"576_CR3","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Chakrabarti, K., Xin, D.: Fast personalized pagerank on mapreduce. In: SIGMOD, pp. 973\u2013984 (2011)","DOI":"10.1145\/1989323.1989425"},{"issue":"3","key":"576_CR4","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"},{"issue":"3\u20134","key":"576_CR5","first-page":"137","volume":"21","author":"S Beamer","year":"2013","unstructured":"Beamer, S., Asanovi\u0107, K., Patterson, D.: Direction-optimizing breadth-first search. Sci. Program. 21(3\u20134), 137\u2013148 (2013)","journal-title":"Sci. Program."},{"issue":"2","key":"576_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"RP Brent","year":"1974","unstructured":"Brent, R.P.: The parallel evaluation of general arithmetic expressions. J. ACM 21(2), 201\u2013206 (1974)","journal-title":"J. ACM"},{"key":"576_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 442\u2013446. SIAM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"issue":"3","key":"576_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci. 55(3), 441\u2013453 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"576_CR9","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"576_CR10","doi-asserted-by":"crossref","unstructured":"Coskun, M., Grama, A., Koyut\u00fcrk, M.: Efficient processing of network proximity queries via chebyshev acceleration. In: SIGKDD, pp. 1515\u20131524 (2016)","DOI":"10.1145\/2939672.2939828"},{"issue":"1","key":"576_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: Openmp: an industry standard API for shared-memory programming. IEEE Comput. Sci. Eng. 5(1), 46\u201355 (1998)","journal-title":"IEEE Comput. Sci. Eng."},{"issue":"3","key":"576_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D Fogaras","year":"2005","unstructured":"Fogaras, D., R\u00e1cz, B., Csalog\u00e1ny, K., Sarl\u00f3s, T.: Towards scaling fully personalized pagerank: algorithms, lower bounds, and experiments. Internet Math. 2(3), 333\u2013358 (2005)","journal-title":"Internet Math."},{"issue":"5","key":"576_CR13","first-page":"442","volume":"5","author":"Y Fujiwara","year":"2012","unstructured":"Fujiwara, Y., Nakatsuji, M., Onizuka, M., Kitsuregawa, M.: Fast and exact top-k search for random walk with restart. PVLDB 5(5), 442\u2013453 (2012)","journal-title":"PVLDB"},{"key":"576_CR14","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Shiokawa, H., Mishima, T., Onizuka, M.: Efficient ad-hoc search for personalized pagerank. In: SIGMOD, pp. 445\u2013456 (2013)","DOI":"10.1145\/2463676.2463717"},{"key":"576_CR15","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Yamamuro, T., Shiokawa, H., Onizuka, M.: Efficient personalized pagerank with accuracy assurance. In: SIGKDD, pp. 15\u201323 (2012)","DOI":"10.1145\/2339530.2339538"},{"key":"576_CR16","doi-asserted-by":"crossref","unstructured":"Guo, T., Cao, X., Cong, G., Lu, J., Lin, X.: Distributed algorithms on exact personalized pagerank. In: SIGMOD, pp. 479\u2013494 (2017)","DOI":"10.1145\/3035918.3035920"},{"issue":"1","key":"576_CR17","first-page":"93","volume":"11","author":"W Guo","year":"2017","unstructured":"Guo, W., Li, Y., Sha, M., Tan, K.-L.: Parallel personalized pagerank on dynamic graphs. PVLDB 11(1), 93\u2013106 (2017)","journal-title":"PVLDB"},{"key":"576_CR18","doi-asserted-by":"crossref","unstructured":"Gupta, M., Pathak, A., Chakrabarti, S.: Fast algorithms for topk personalized pagerank queries. In: WWW, pp. 1225\u20131226 (2008)","DOI":"10.1145\/1367497.1367738"},{"key":"576_CR19","doi-asserted-by":"crossref","unstructured":"Gupta, P., Goel, A., Lin, J.J., Sharma, A., Wang, D., Zadeh, R.: WTF: the who to follow service at twitter. In: WWW, pp. 505\u2013514 (2013)","DOI":"10.1145\/2488388.2488433"},{"key":"576_CR20","unstructured":"https:\/\/www.cilkplus.org\/\n\n (2018)"},{"key":"576_CR21","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW, pp. 271\u2013279 (2003)","DOI":"10.1145\/775152.775191"},{"key":"576_CR22","doi-asserted-by":"crossref","unstructured":"Jung, J., Park, N., Sael, L., Kang, U.: Bepi: fast and memory-efficient method for billion-scale random walk with restart. In: SIGMOD, pp 789\u2013804 (2017)","DOI":"10.1145\/3035918.3035950"},{"key":"576_CR23","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E., Schardl, T.B.: A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). In: SPAA, pp. 303\u2013314 (2010)","DOI":"10.1145\/1810479.1810534"},{"key":"576_CR24","doi-asserted-by":"crossref","unstructured":"Lin, W.: Distributed algorithms for fully personalized pagerank on large graphs. In: WWW, pp. 1084\u20131094 (2019)","DOI":"10.1145\/3308558.3313555"},{"key":"576_CR25","doi-asserted-by":"crossref","unstructured":"Liu, D.C., Rogers, S., Shiau, R., Kislyuk, D., Ma, K.C., Zhong, Z., Liu, J., Jing, Y.: Related pins at pinterest: the evolution of a real-world recommender system. In: WWW, pp. 583\u2013592 (2017)","DOI":"10.1145\/3041021.3054202"},{"key":"576_CR26","doi-asserted-by":"crossref","unstructured":"Lofgren, P., Banerjee, S., Goel, A.: Personalized pagerank estimation and search: a bidirectional approach. In: WSDM, pp. 163\u2013172 (2016)","DOI":"10.1145\/2835776.2835823"},{"key":"576_CR27","doi-asserted-by":"crossref","unstructured":"Nguyen, P., Tomeo, P., Noia, T.D., Sciascio, E.D.: An evaluation of simrank and personalized pagerank to build a recommender system for the web of data. In: WWW, pp. 1477\u20131482 (2015)","DOI":"10.1145\/2740908.2742141"},{"key":"576_CR28","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"576_CR29","doi-asserted-by":"crossref","unstructured":"Park, H., Jung, J., Kang, U.: A comparative study of matrix factorization and random walk with restart in recommender systems. In: BigData, pp. 756\u2013765 (2017)","DOI":"10.1109\/BigData.2017.8257991"},{"key":"576_CR30","doi-asserted-by":"crossref","unstructured":"Shin, K., Jung, J., Sael, L., Kang, U.: BEAR: block elimination approach for random walk with restart on large graphs. In: SIGMOD, pp. 1571\u20131585 (2015)","DOI":"10.1145\/2723372.2723716"},{"issue":"8","key":"576_CR31","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/2517327.2442530","volume":"48","author":"Julian Shun","year":"2013","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: PPoPP, pp. 135\u2013146 (2013)","journal-title":"ACM SIGPLAN Notices"},{"key":"576_CR32","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Phase-concurrent hash tables for determinism. In: SPAA, pp. 96\u2013107 (2014)","DOI":"10.1145\/2612669.2612687"},{"issue":"12","key":"576_CR33","first-page":"1041","volume":"9","author":"J Shun","year":"2016","unstructured":"Shun, J., Roosta-Khorasani, F., Fountoulakis, K., Mahoney, M.W.: Parallel local graph clustering. PVLDB 9(12), 1041\u20131052 (2016)","journal-title":"PVLDB"},{"issue":"3","key":"576_CR34","doi-asserted-by":"publisher","first-page":"205","DOI":"10.14778\/3021924.3021936","volume":"10","author":"S Wang","year":"2016","unstructured":"Wang, S., Tang, Y., Xiao, X., Yang, Y., Li, Z.: Hubppr: effective indexing for approximate personalized pagerank. Proc. VLDB Endow. 10(3), 205\u2013216 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"576_CR35","doi-asserted-by":"crossref","unstructured":"Wang, S., Tao, Y.: Efficient algorithms for finding approximate heavy hitters in personalized pageranks. In: SIGMOD, pp. 1113\u20131127 (2018)","DOI":"10.1145\/3183713.3196919"},{"key":"576_CR36","doi-asserted-by":"crossref","unstructured":"Wang, S., Yang, R., Xiao, X., Wei, Z., Yang, Y.: FORA: simple and effective approximate single-source personalized pagerank. In: SIGKDD, pp. 505\u2013514 (2017)","DOI":"10.1145\/3097983.3098072"},{"key":"576_CR37","doi-asserted-by":"crossref","unstructured":"Wei, H., Yu, J.X., Lu, C., Lin, X.: Speedup graph processing by graph ordering. In: SIGMOD, pp. 1813\u20131828 (2016)","DOI":"10.1145\/2882903.2915220"},{"key":"576_CR38","doi-asserted-by":"crossref","unstructured":"Wei, Z., He, X., Xiao, X., Wang, S., Shang, S., Wen, J.-R.: Topppr: top-k personalized pagerank queries with precision guarantees on large graphs. In: SIGMOD, pp. 441\u2013456 (2018)","DOI":"10.1145\/3183713.3196920"},{"issue":"5","key":"576_CR39","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1109\/TKDE.2016.2518687","volume":"28","author":"JJ Whang","year":"2016","unstructured":"Whang, J.J., Gleich, D.F., Dhillon, I.S.: Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans. Knowl. Data Eng. 28(5), 1272\u20131284 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"576_CR40","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: SIGKDD, pp. 555\u2013564 (2017)","DOI":"10.1145\/3097983.3098069"},{"key":"576_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, H., Lofgren, P., Goel, A.: Approximate personalized pagerank on dynamic graphs. In: SIGKDD, pp. 1315\u20131324 (2016)","DOI":"10.1145\/2939672.2939804"},{"issue":"6","key":"576_CR42","first-page":"481","volume":"6","author":"F Zhu","year":"2013","unstructured":"Zhu, F., Fang, Y., Chang, K.C., Ying, J.: Incremental and accuracy-aware personalized pagerank through scheduled approximation. PVLDB 6(6), 481\u2013492 (2013)","journal-title":"PVLDB"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00576-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00576-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00576-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:24:40Z","timestamp":1602026680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00576-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,8]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["576"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00576-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,8]]},"assertion":[{"value":"23 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}