{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:21Z","timestamp":1750307481938,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,25]]},"DOI":"10.1145\/1835804.1835871","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"513-522","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Fast nearest-neighbor search in disk-resident graphs"],"prefix":"10.1145","author":[{"given":"Purnamrita","family":"Sarkar","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}]},{"given":"Andrew W.","family":"Moore","sequence":"additional","affiliation":[{"name":"Google inc, Pittsburgh, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Reversible Markov Chains","author":"Aldous D.","year":"2001","unstructured":"D. Aldous and J. A. Fill . Reversible Markov Chains . 2001 . D. Aldous and J. A. Fill. Reversible Markov Chains. 2001."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_3_1","volume-title":"VLDB","author":"Balmin A.","year":"2004","unstructured":"A. Balmin , V. Hristidis , and Y. Papakonstantinou . ObjectRank: Authority-based keyword search in databases . In VLDB , 2004 . A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-based keyword search in databases. In VLDB, 2004."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129116"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.2"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242650"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076186"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453982"},{"key":"e_1_3_2_2_10_1","volume-title":"Internet Mathematics","author":"Fogaras D.","year":"2004","unstructured":"D. Fogaras , B. Rcz , K. Csalogany , and T. Sarlos . Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments . Internet Mathematics , 2004 . D. Fogaras, B. Rcz, K. Csalogany, and T. Sarlos. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics, 2004."},{"key":"e_1_3_2_2_11_1","unstructured":"F. C. Graham and W. Zhao. Pagerank and random walks on graphs. In Fete of Combinatorics\".  F. C. Graham and W. Zhao. Pagerank and random walks on graphs. In Fete of Combinatorics\"."},{"key":"e_1_3_2_2_12_1","first-page":"587","volume-title":"VLDB","author":"Gyongyi Z.","year":"2004","unstructured":"Z. Gyongyi , H. Garcia-Molina , and J. Pedersen . Combating web spam with trustrank . In VLDB , pages 576{ 587 , 2004 . Z. Gyongyi, H. Garcia-Molina, and J. Pedersen. Combating web spam with trustrank. In VLDB, pages 576{587, 2004."},{"key":"e_1_3_2_2_13_1","volume-title":"Manipulation-resistant reputations using hitting time. Technical report","author":"Hopcroft J.","year":"2007","unstructured":"J. Hopcroft and D. Sheldon . Manipulation-resistant reputations using hitting time. Technical report , Cornell University , 2007 . J. Hopcroft and D. Sheldon. Manipulation-resistant reputations using hitting time. Technical report, Cornell University, 2007."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242730"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458145"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5244\/C.19.94"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11744023_13"},{"key":"e_1_3_2_2_22_1","volume-title":"Machine Learning Department","author":"Sarkar P.","year":"2010","unstructured":"P. Sarkar and A. Moore . Fast nearest-neighbor search in disk-resident graphs. Technical report:10-005 , Machine Learning Department , Carnegie Mellon University , 2010 . P. Sarkar and A. Moore. Fast nearest-neighbor search in disk-resident graphs. Technical report:10-005, Machine Learning Department, Carnegie Mellon University, 2010."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135823"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376928"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_2_26_1","volume-title":"ICML","volume":"20","author":"Zhu X.","year":"2003","unstructured":"X. Zhu , Z. Ghahramani , and J. Lafferty . Semi-supervised learning using gaussian fields and harmonic functions . In ICML , volume 20 , 2003 . X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, volume 20, 2003."}],"event":{"name":"KDD '10: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Washington DC USA","acronym":"KDD '10"},"container-title":["Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835871","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835804.1835871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:09:02Z","timestamp":1750248542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":25,"alternative-id":["10.1145\/1835804.1835871","10.1145\/1835804"],"URL":"https:\/\/doi.org\/10.1145\/1835804.1835871","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}