{"id":"https://openalex.org/W2129565593","doi":"https://doi.org/10.1145/1989323.1989425","title":"Fast personalized PageRank on MapReduce","display_name":"Fast personalized PageRank on MapReduce","publication_year":2011,"publication_date":"2011-06-12","ids":{"openalex":"https://openalex.org/W2129565593","doi":"https://doi.org/10.1145/1989323.1989425","mag":"2129565593"},"language":"en","primary_location":{"id":"doi:10.1145/1989323.1989425","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989323.1989425","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112444678","display_name":"Bahman Bahmani","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bahman Bahmani","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113509258","display_name":"Kaushik Chakrabarti","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kaushik Chakrabarti","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101406351","display_name":"Dong Xin","orcid":"https://orcid.org/0000-0002-1414-9354"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dong Xin","raw_affiliation_strings":["Google Inc., Mountain View, CA, USA","Google Inc., Mountain View, CA USA"],"affiliations":[{"raw_affiliation_string":"Google Inc., Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Inc., Mountain View, CA USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112444678"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":13.8745,"has_fulltext":false,"cited_by_count":139,"citation_normalized_percentile":{"value":0.99196238,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"973","last_page":"984"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.8915137052536011},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8356308341026306},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.6135827898979187},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5864224433898926},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5471304059028625},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.50174880027771},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35270217061042786},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3313477039337158},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11222299933433533}],"concepts":[{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.8915137052536011},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8356308341026306},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6135827898979187},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5864224433898926},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5471304059028625},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.50174880027771},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35270217061042786},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3313477039337158},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11222299933433533},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1989323.1989425","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989323.1989425","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1550457191","https://openalex.org/W1845137714","https://openalex.org/W1854214752","https://openalex.org/W1967172267","https://openalex.org/W2019724001","https://openalex.org/W2020302654","https://openalex.org/W2033252376","https://openalex.org/W2039191721","https://openalex.org/W2069153192","https://openalex.org/W2098935637","https://openalex.org/W2100830825","https://openalex.org/W2107577105","https://openalex.org/W2119400430","https://openalex.org/W2126399065","https://openalex.org/W2139146018","https://openalex.org/W2140350208","https://openalex.org/W2141075029","https://openalex.org/W2154894831","https://openalex.org/W2160555926","https://openalex.org/W2167927436","https://openalex.org/W2170344111","https://openalex.org/W2173213060","https://openalex.org/W2420733993","https://openalex.org/W2950696249","https://openalex.org/W6639055396"],"related_works":["https://openalex.org/W2106626222","https://openalex.org/W2980866815","https://openalex.org/W1562405179","https://openalex.org/W2125493559","https://openalex.org/W1544909909","https://openalex.org/W2002053721","https://openalex.org/W2001641889","https://openalex.org/W2310552679","https://openalex.org/W4321488442","https://openalex.org/W1992077244"],"abstract_inverted_index":{"In":[0],"this":[1,118],"paper,":[2],"we":[3,47,115],"design":[4,48],"a":[5,22,35,49,54,58,62,91],"fast":[6],"MapReduce":[7,50,82,139,156],"algorithm":[8,87,119,144],"for":[9,96],"Monte":[10],"Carlo":[11],"approximation":[12],"of":[13,17,34,66,81,94],"personalized":[14,126],"PageRank":[15,127],"vectors":[16],"all":[18,124,150],"the":[19,43,79,97,107,125,151,155],"nodes":[20],"in":[21,42,73,137,154],"graph.":[23,44],"The":[24],"basic":[25],"idea":[26],"is":[27,88,103,145],"very":[28,121],"efficiently":[29,122],"doing":[30],"single":[31,63],"random":[32,64],"walks":[33],"given":[36,53],"length":[37,59,67],"starting":[38,69],"at":[39,70],"each":[40,71],"node":[41,72],"More":[45],"precisely,":[46],"algorithm,":[51],"which":[52],"graph":[55,134],"G":[56],"and":[57,99,136],"\u00bb,":[60],"outputs":[61],"walk":[65],"\u00bb":[68],"G.":[74],"We":[75,110],"will":[76,111],"show":[77,113],"that":[78,142],"number":[80],"iterations":[83],"used":[84],"by":[85],"our":[86,143],"optimal":[89],"among":[90],"broad":[92],"family":[93],"algorithms":[95,153],"problem,":[98],"its":[100],"I/O":[101],"efficiency":[102],"much":[104],"better":[105],"than":[106,149],"existing":[108,152],"candidates.":[109],"then":[112],"how":[114],"can":[116],"use":[117],"to":[120],"approximate":[123],"vectors.":[128],"Our":[129],"empirical":[130],"evaluation":[131],"on":[132],"real-life":[133],"data":[135],"production":[138],"environment":[140],"shows":[141],"significantly":[146],"more":[147],"efficient":[148],"setting.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":22},{"year":2013,"cited_by_count":22},{"year":2012,"cited_by_count":8}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
