{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:19:46Z","timestamp":1768029586749,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662480953","type":"print"},{"value":"9783662480960","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48096-0_34","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T06:16:03Z","timestamp":1437718563000},"page":"438-450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Scalable Data-Driven PageRank: Algorithms, System Issues, and Lessons Learned"],"prefix":"10.1007","author":[{"given":"Joyce Jiyoung","family":"Whang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lenharth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inderjit S.","family":"Dhillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using PageRank vectors. In: FOCS, pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"34_CR2","volume-title":"Label Propagation and Quadratic Criterion","author":"Y Bengio","year":"2006","unstructured":"Bengio, Y., Delalleau, O., Le Roux, N.: Label Propagation and Quadratic Criterion. MIT Press, Cambridge (2006)"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P Berkhin","year":"2005","unstructured":"Berkhin, P.: A survey on PageRank computing. Internet Math. 2, 73\u2013120 (2005)","journal-title":"Internet Math."},{"issue":"1\u20137","key":"34_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Network. ISDN Syst. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Network. ISDN Syst."},{"key":"34_CR5","unstructured":"Gleich, D.F., Zhukov, L., Berkhin, P.: Fast parallel PageRank: A linear system approach. Technical report YRL-2004-038, Yahoo! Research Labs (2004)"},{"key":"34_CR6","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":"34_CR7","doi-asserted-by":"crossref","unstructured":"Lenharth, A., Nguyen, D., Pingali, K.: Priority queues are not good concurrent\npriority schedulers. In: Tr\u00e4ff, J.L., Hunold, S., Versaci, F. (eds.) Euro-Par 2015. LNCS, vol. 9233, pp. 209\u2013221. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-48096-0_17"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning and data mining in the cloud. In: VLDB Endowment, pp. 716\u2013727 (2012)","DOI":"10.14778\/2212351.2212354"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"McSherry, F.: A uniform approach to accelerated PageRank computation. In: WWW, pp. 575\u2013582 (2005)","DOI":"10.1145\/1060745.1060829"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Nguyen, D., Lenharth, A., Pingali, K.: A lightweight infrastructure for graph analytics. In: SOSP, pp. 456\u2013471 (2013)","DOI":"10.1145\/2517349.2522739"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen, D., Pingali, K.: Synthesizing concurrent schedulers for irregular algorithms. In: ASPLOS, pp. 333\u2013344 (2011)","DOI":"10.1145\/1961295.1950404"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M.A., Kaleem, R., Lee, T.H., Lenharth, A., Manevich, R., Mndez-Lojo, M., Prountzos, D., Sui, X.: The Tao of parallelism in algorithms. In: PLDI, pp. 12\u201325 (2011)","DOI":"10.1145\/1993316.1993501"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: PPoPP, pp. 135\u2013146 (2013)","DOI":"10.1145\/2517327.2442530"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Whang, J.J., Gleich, D., Dhillon, I.S.: Overlapping community detection using seed set expansion. In: CIKM, pp. 2099\u20132108 (2013)","DOI":"10.1145\/2505515.2505535"},{"issue":"9","key":"34_CR15","doi-asserted-by":"publisher","first-page":"1884","DOI":"10.1109\/TPDS.2012.272","volume":"24","author":"Y Zhang","year":"2013","unstructured":"Zhang, Y., Gao, Q., Gao, L., Wang, C.: Priter: a distributed framework for prioritizing iterative computations. IEEE Trans. Parallel Distrib. Syst. 24(9), 1884\u20131893 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"8","key":"34_CR16","doi-asserted-by":"publisher","first-page":"2091","DOI":"10.1109\/TPDS.2013.235","volume":"25","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Gao, Q., Gao, L., Wang, C.: Maiter: an asynchronous graph processing framework for delta-based accumulative iterative computation. IEEE Trans. Parallel Distrib. Syst. 25(8), 2091\u20132100 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2015: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48096-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:34:51Z","timestamp":1587342891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48096-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480953","9783662480960"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48096-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}