{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:13Z","timestamp":1750220713257,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366423.3380035","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:16:51Z","timestamp":1588580211000},"page":"2761-2767","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Scaling PageRank to 100 Billion Pages"],"prefix":"10.1145","author":[{"given":"Stergios","family":"Stergiou","sequence":"first","affiliation":[{"name":"Google"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2016. Common Crawl. http:\/\/commoncrawl.org\/.  2016. Common Crawl. http:\/\/commoncrawl.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"2016. Twitter User Graph. http:\/\/konect.uni-koblenz.de\/networks\/twitter_mpi.  2016. Twitter User Graph. http:\/\/konect.uni-koblenz.de\/networks\/twitter_mpi."},{"key":"e_1_3_2_1_3_1","unstructured":"2016. Web Data Commons. http:\/\/webdatacommons.org\/.  2016. Web Data Commons. http:\/\/webdatacommons.org\/."},{"key":"e_1_3_2_1_4_1","unstructured":"2017. Apache Giraph. http:\/\/giraph.apache.org\/.  2017. Apache Giraph. http:\/\/giraph.apache.org\/."},{"key":"e_1_3_2_1_5_1","unstructured":"2020. Facebook Company Info. http:\/\/newsroom.fb.com\/company-info\/.  2020. Facebook Company Info. http:\/\/newsroom.fb.com\/company-info\/."},{"key":"e_1_3_2_1_6_1","unstructured":"2020. How Search organizes information. https:\/\/www.google.com\/search \/howsearchworks\/crawling-indexing\/.  2020. How Search organizes information. https:\/\/www.google.com\/search \/howsearchworks\/crawling-indexing\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480506.1480511"},{"volume-title":"Automated Reasoning Series, Vol.\u00a01","author":"Boyer S.","key":"e_1_3_2_1_8_1","unstructured":"Robert S. Boyer and J. Strother Moore . 1991. MJRTY-A Fast Majority Vote Algorithm . In Automated Reasoning, RobertS. Boyer (Ed.). Automated Reasoning Series, Vol.\u00a01 . Springer Netherlands , 105\u2013117. RobertS. Boyer and J.Strother Moore. 1991. MJRTY-A Fast Majority Vote Algorithm. In Automated Reasoning, RobertS. Boyer (Ed.). Automated Reasoning Series, Vol.\u00a01. Springer Netherlands, 105\u2013117."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920881"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741970"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454225"},{"key":"e_1_3_2_1_14_1","volume-title":"PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs.OSDI","author":"Gonzalez JE","year":"2012","unstructured":"JE Gonzalez , Y Low , H Gu , D Bickson , and C Guestrin . 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs.OSDI ( 2012 ). JE Gonzalez, Y Low, H Gu, D Bickson, and C Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs.OSDI (2012)."},{"volume-title":"OSDI\u201914 Proceedings of the 11th USENIX conference on Operating Systems Design and Implementation.","author":"Gonzalez JE","key":"e_1_3_2_1_15_1","unstructured":"JE Gonzalez , RS Xin , and A Dave . [n.d.]. GraphX : Graph Processing in a Distributed Dataflow Framework . In OSDI\u201914 Proceedings of the 11th USENIX conference on Operating Systems Design and Implementation. JE Gonzalez, RS Xin, and A Dave. [n.d.]. GraphX: Graph Processing in a Distributed Dataflow Framework. In OSDI\u201914 Proceedings of the 11th USENIX conference on Operating Systems Design and Implementation."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732980"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911531"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"e_1_3_2_1_21_1","unstructured":"Aapo Kyrola Guy\u00a0E Blelloch Carlos Guestrin 2012. GraphChi: Large-Scale Graph Computation on Just a PC.. In OSDI Vol.\u00a012. 31\u201346.  Aapo Kyrola Guy\u00a0E Blelloch Carlos Guestrin 2012. GraphChi: Large-Scale Graph Computation on Just a PC.. In OSDI Vol.\u00a012. 31\u201346."},{"key":"e_1_3_2_1_22_1","unstructured":"AN Langville and CD Meyer. 2011. Google\u2019s PageRank and beyond: The science of search engine rankings.  AN Langville and CD Meyer. 2011. Google\u2019s PageRank and beyond: The science of search engine rankings."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/141818.141820"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_3_2_1_26_1","volume-title":"The PageRank Citation Ranking: Bringing Order to the Web. Stanford InfoLab","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page , Sergey Brin , Rajeev Motwani , and Terry Winograd . 1999. The PageRank Citation Ranking: Bringing Order to the Web. Stanford InfoLab ( 1999 ). Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Stanford InfoLab (1999)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159696"},{"volume-title":"Distributed Negative Sampling For Word Embeddings. In AAAI\u201917 Thirty-First AAAI Conference on Artificial Intelligence.","author":"Stergiou Stergios","key":"e_1_3_2_1_31_1","unstructured":"Stergios Stergiou , Zygimantas Straznickas , Rolina Wu , and Kostas Tsioutsiouliklis . [n.d.]. Distributed Negative Sampling For Word Embeddings. In AAAI\u201917 Thirty-First AAAI Conference on Artificial Intelligence. Stergios Stergiou, Zygimantas Straznickas, Rolina Wu, and Kostas Tsioutsiouliklis. [n.d.]. Distributed Negative Sampling For Word Embeddings. In AAAI\u201917 Thirty-First AAAI Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741096"},{"key":"e_1_3_2_1_35_1","volume-title":"Kylix: A Sparse Allreduce for Commodity Clusters. In 43rd International Conference on Parallel Processing (ICPP).","author":"Zhao H","year":"2014","unstructured":"H Zhao and J Canny . 2014 . Kylix: A Sparse Allreduce for Commodity Clusters. In 43rd International Conference on Parallel Processing (ICPP). H Zhao and J Canny. 2014. Kylix: A Sparse Allreduce for Commodity Clusters. In 43rd International Conference on Parallel Processing (ICPP)."}],"event":{"name":"WWW '20: The Web Conference 2020","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Taipei Taiwan","acronym":"WWW '20"},"container-title":["Proceedings of The Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380035","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:16Z","timestamp":1750199596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":35,"alternative-id":["10.1145\/3366423.3380035","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380035","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}