{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:00Z","timestamp":1750306680483,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":3,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Google Focused Award Web Alter-Ego"},{"name":"Conicyt\/Beca Doctorado en el Extranjero Folio","award":["72140173"],"award-info":[{"award-number":["72140173"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1145\/2678508.2678513","type":"proceedings-article","created":{"date-parts":[[2014,11,26]],"date-time":"2014-11-26T15:45:24Z","timestamp":1417016724000},"page":"9-10","source":"Crossref","is-referenced-by-count":2,"title":["Scaling KNN computation over large graphs on a PC"],"prefix":"10.1145","author":[{"given":"Nitin","family":"Chiluka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Olivares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2678508.2678513-1","doi-asserted-by":"crossref","unstructured":"W. Dong, C. Moses, and K. Li. Efficient k-nearest neighbor graph construction for generic similarity measures. InWWW, 2011.","DOI":"10.1145\/1963405.1963487"},{"key":"key-10.1145\/2678508.2678513-2","unstructured":"A. Kyrola, G. E. Blelloch, and C. Guestrin. Graphchi: Large-scale graph computation on just a pc. InOSDI, 2012."},{"key":"key-10.1145\/2678508.2678513-3","doi-asserted-by":"crossref","unstructured":"A. Roy, I. Mihailovic, and W. Zwaenepoel. X-stream: edge-centric graph processing using streaming partitions. InSOSP, 2013.","DOI":"10.1145\/2517349.2522740"}],"event":{"name":"the Posters & Demos Session","start":{"date-parts":[[2014,12,8]]},"number":"2014","location":"Bordeaux, France","end":{"date-parts":[[2014,12,12]]},"acronym":"Middleware Posters and Demos '14"},"container-title":["Proceedings of the Posters & Demos Session on - Middleware Posters and Demos '14"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2678508.2678513","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2678513&ftid=1515921&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:10Z","timestamp":1750230070000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2678508.2678513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":3,"URL":"https:\/\/doi.org\/10.1145\/2678508.2678513","relation":{},"subject":[],"published":{"date-parts":[[2014]]}}}