{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:05Z","timestamp":1761621005332,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,2,9]],"date-time":"2009-02-09T00:00:00Z","timestamp":1234137600000},"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":[[2009,2,9]]},"DOI":"10.1145\/1498759.1498832","type":"proceedings-article","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T16:46:07Z","timestamp":1234284367000},"page":"242-251","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Less is more"],"prefix":"10.1145","author":[{"given":"Marc","family":"Najork","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sreenivas","family":"Gollapudi","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rina","family":"Panigrahy","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,2,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_1_4_1","first-page":"721","volume-title":"Discovering Large Dense Subgraphs in Massive Graphs. In 31st International Conference On Very Large Data Bases","author":"Gibson D.","year":"2005"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777895"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_7_1","first-page":"668","volume-title":"9th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Kleinberg J. M.","year":"1998"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00034-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/382979.383041"},{"key":"e_1_3_2_1_11_1","unstructured":"G. Linden. Marissa Mayer at Web 2.0. Online at: http:\/\/glinden.blogspot.com\/2006\/11\/marissa-mayer-at-web-20.html  G. Linden. Marissa Mayer at Web 2.0. Online at: http:\/\/glinden.blogspot.com\/2006\/11\/marissa-mayer-at-web-20.html"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(97)00036-6"},{"key":"e_1_3_2_1_13_1","first-page":"414","volume-title":"Computing Information Retrieval Performance Measures Efficiently in the Presence of Tied Scores. In 30th European Conference on Information Retrieval","author":"McSherry F.","year":"2008"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277823"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321465"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458093"},{"volume-title":"Stanford Digital Library Technologies Project","year":"1998","author":"Page L.","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055569"},{"volume-title":"13th Text Retrieval Conference","year":"2004","author":"Zaragoza H.","key":"e_1_3_2_1_19_1"}],"event":{"name":"WSDM'09: Second ACM International Conference on Web Search and Web Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","Yahoo! Research","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","Nokia","Google Inc.","SIGIR ACM Special Interest Group on Information Retrieval","Microsoft Microsoft"],"location":"Barcelona Spain","acronym":"WSDM'09"},"container-title":["Proceedings of the Second ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1498759.1498832","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1498759.1498832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:38Z","timestamp":1750253918000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1498759.1498832"}},"subtitle":["sampling the neighborhood graph makes SALSA better and faster"],"short-title":[],"issued":{"date-parts":[[2009,2,9]]},"references-count":19,"alternative-id":["10.1145\/1498759.1498832","10.1145\/1498759"],"URL":"https:\/\/doi.org\/10.1145\/1498759.1498832","relation":{},"subject":[],"published":{"date-parts":[[2009,2,9]]},"assertion":[{"value":"2009-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}