{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:05Z","timestamp":1740108305850,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T00:00:00Z","timestamp":1524700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002848","name":"Comisi\u00f3n Nacional de Investigaci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","award":["72140173"],"award-info":[{"award-number":["72140173"]}],"id":[{"id":"10.13039\/501100002848","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00607-018-0616-7","type":"journal-article","created":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T03:13:44Z","timestamp":1524712424000},"page":"19-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The out-of-core KNN awakens: the light side of computation force on large datasets"],"prefix":"10.1007","volume":"101","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8955-5672","authenticated-orcid":false,"given":"Javier","family":"Olivares","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitin","family":"Chiluka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,26]]},"reference":[{"key":"616_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed A, Shervashidze N, Narayanamurthy S, Josifovski V, Smola AJ (2013) Distributed large-scale natural graph factorization. In: Proceedings of the 22nd international conference on world wide web, WWW\u201913. International World Wide Web Conferences Steering Committee, pp 37\u201348","DOI":"10.1145\/2488388.2488393"},{"key":"616_CR2","doi-asserted-by":"crossref","unstructured":"Beygelzimer A, Kakade S, Langford J (2006) Cover trees for nearest neighbor. In: Proceedings of the 23rd international conference on machine learning. ACM, pp 97\u2013104","DOI":"10.1145\/1143844.1143857"},{"key":"616_CR3","doi-asserted-by":"crossref","unstructured":"Boiman O, Shechtman E, Irani M (2008) In defense of nearest-neighbor based image classification. In: IEEE conference on computer vision and pattern recognition, pp 1\u20138","DOI":"10.1109\/CVPR.2008.4587598"},{"key":"616_CR4","doi-asserted-by":"crossref","unstructured":"Boutet A, Frey D, Guerraoui R, Jegou A, Kermarrec AM (2013) Whatsup: a decentralized instant news recommender. In: IEEE 27th international symposium on parallel distributed processing (IPDPS), pp 741\u2013752","DOI":"10.1109\/IPDPS.2013.47"},{"key":"616_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-319-09581-3_12","volume-title":"Networked systems, LNCS","author":"A Boutet","year":"2014","unstructured":"Boutet A, Frey D, Guerraoui R, Jegou A, Kermarrec AM (2014) Privacy-preserving distributed collaborative filtering. In: Noubir G, Raynal M (eds) Networked systems, LNCS, vol 8593. Springer, Berlin, pp 169\u2013184"},{"key":"616_CR6","doi-asserted-by":"crossref","unstructured":"Boutet A, Frey D, Guerraoui R, Kermarrec AM, Patra R (2014) Hyrec: leveraging browsers for scalable recommenders. In: Proceedings of the 15th international middleware conference. ACM, pp 85\u201396","DOI":"10.1145\/2663165.2663315"},{"key":"616_CR7","first-page":"1989","volume":"10","author":"J Chen","year":"2009","unstructured":"Chen J, Fang H, Saad Y (2009) Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection. J Mach Learn Res 10:1989\u20132012","journal-title":"J Mach Learn Res"},{"key":"616_CR8","doi-asserted-by":"crossref","unstructured":"Chiluka N, Kermarrec AM, Olivares J (2014) Scaling kNN computation over large graphs on a PC. In: Proceedings of the posters and demos session, middleware\u201914. ACM, pp 9\u201310","DOI":"10.1145\/2678508.2678513"},{"key":"616_CR9","doi-asserted-by":"crossref","unstructured":"Debatty T, Michiardi P, Thonnard O, Mees W (2014) Building k-NN graphs from large text data. In: IEEE international conference on big data, pp 573\u2013578","DOI":"10.1109\/BigData.2014.7004276"},{"key":"616_CR10","doi-asserted-by":"crossref","unstructured":"Dong W, Moses C, Li K (2011) Efficient $$k$$ k -nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th international conference on world wide web. ACM, pp 577\u2013586","DOI":"10.1145\/1963405.1963487"},{"issue":"7","key":"616_CR11","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"C\u201324","author":"K Fukunaga","year":"1975","unstructured":"Fukunaga K, Narendra PM (1975) A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans Comput C\u201324(7):750\u2013753","journal-title":"IEEE Trans Comput"},{"key":"616_CR12","doi-asserted-by":"crossref","unstructured":"Han WS, Lee S, Park K, Lee JH, Kim MS, Kim J, Yu H (2013) Turbograph: a fast parallel graph engine handling billion-scale graphs in a single PC. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 77\u201385","DOI":"10.1145\/2487575.2487581"},{"key":"616_CR13","doi-asserted-by":"crossref","unstructured":"J\u00e9gou H, Tavenard R, Douze M, Amsaleg L (2011) Searching in one billion vectors: re-rank with source coding. In: IEEE international conference on acoustics, speech and signal processing, pp 861\u2013864","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"616_CR14","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The SR-tree: An index structure for high-dimensional nearest neighbor queries. In: Proceedings of the international conference on management of data. ACM, pp 369\u2013380","DOI":"10.1145\/253260.253347"},{"key":"616_CR15","doi-asserted-by":"crossref","unstructured":"Kermarrec AM, Mittal N, Olivares J (2017) Multithreading approach to process real-time updates in kNN algorithms. In: 5th international conference on networked systems. Springer, pp 109\u2013114","DOI":"10.1007\/978-3-319-59647-1_9"},{"key":"616_CR16","unstructured":"Kyrola A, Blelloch G, Guestrin C (2012) Graphchi: large-scale graph computation on just a PC. In: 10th USENIX symposium on operating systems design and implementation (OSDI 12). USENIX, pp 31\u201346"},{"key":"616_CR17","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"616_CR18","doi-asserted-by":"crossref","unstructured":"Lin Z, Kahng M, Sabrin K, Chau D, Lee H, Kang U (2014) Mmap: fast billion-scale graph computation on a PC via memory mapping. In: IEEE international conference on big data, pp 159\u2013164","DOI":"10.1109\/BigData.2014.7004226"},{"issue":"2","key":"616_CR19","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0034-4257(02)00064-0","volume":"82","author":"RE McRoberts","year":"2002","unstructured":"McRoberts RE, Nelson MD, Wendt DG (2002) Stratified estimation of forest area using satellite imagery, inventory data, and the $$k$$ k -nearest neighbors technique. Remote Sens Environ 82(2):457\u2013468","journal-title":"Remote Sens Environ"},{"key":"616_CR20","doi-asserted-by":"crossref","unstructured":"Roy A, Mihailovic I, Zwaenepoel W (2013) X-stream: edge-centric graph processing using streaming partitions. In: Proceedings of the 24th ACM symposium on operating systems principles. ACM, pp 472\u2013488","DOI":"10.1145\/2517349.2522740"},{"key":"616_CR21","doi-asserted-by":"crossref","unstructured":"Wang J, Yang J, Yu K, Lv F, Huang T, Gong Y (2010) Locality-constrained linear coding for image classification. In: IEEE conference on computer vision and pattern recognition, pp 3360\u20133367","DOI":"10.1109\/CVPR.2010.5540018"},{"key":"616_CR22","doi-asserted-by":"crossref","unstructured":"Wong WK, Cheung DWl, Kao B, Mamoulis N (2009) Secure kNN computation on encrypted databases. In: Proceedings of the international conference on management of data. ACM, pp 139\u2013152","DOI":"10.1145\/1559845.1559862"},{"key":"616_CR23","unstructured":"Zhu X, Han W, Chen W (2015) Gridgraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: USENIX annual technical conference. USENIX Association, pp 375\u2013386"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0616-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0616-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0616-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T23:01:14Z","timestamp":1571266874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0616-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,26]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["616"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0616-7","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2018,4,26]]},"assertion":[{"value":"30 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}