{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:52:23Z","timestamp":1777733543657,"version":"3.51.4"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/icde.2016.7498244","type":"proceedings-article","created":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T11:36:34Z","timestamp":1466854594000},"page":"241-252","source":"Crossref","is-referenced-by-count":16,"title":["Being prepared in a sparse world: The case of KNN graph construction"],"prefix":"10.1109","author":[{"given":"Antoine","family":"Boutet","sequence":"first","affiliation":[]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[]},{"given":"Nupur","family":"Mittal","sequence":"additional","affiliation":[]},{"given":"Francois","family":"Taiani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806534"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447895"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248043"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.5121\/ijdms.2013.5108"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.9"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021240730564"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"ref10","first-page":"950","article-title":"Multi-probe lsh: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"VLDB"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_125"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.03.013"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45065-5_2"},{"key":"ref16","article-title":"SNAP Datasets: Stanford large network dataset collection","author":"leskovec","year":"2014"},{"key":"ref17","first-page":"1989","article-title":"Fast approximate knn graph construction for high dimensional data via recursive lanczos bisection","volume":"10","author":"chen","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"ref18","author":"van rijsbergen","year":"1979","journal-title":"Information Retrieval"},{"key":"ref19","year":"0","journal-title":"KIFF Knn Impressively Fast and eFficient java library"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816698"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2663165.2663315"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345603"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.54"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.01.001"},{"key":"ref29","first-page":"421","article-title":"Indexing the distance: An efficient method to knn processing","author":"yu","year":"2001","journal-title":"VLDB"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502546"},{"key":"ref7","author":"nodarakis","year":"2014","journal-title":"Rapid aknn query processing for fast classification of multidimensional data in the cloud"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739055"},{"key":"ref9","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"VLDB"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16955-7_10"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1609\/icwsm.v4i1.14033","article-title":"Measuring user influence in twitter: The million follower fallacy","author":"cha","year":"2010","journal-title":"ICWSM"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526806"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.47"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"}],"event":{"name":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","location":"Helsinki, Finland","start":{"date-parts":[[2016,5,16]]},"end":{"date-parts":[[2016,5,20]]}},"container-title":["2016 IEEE 32nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7491900\/7498210\/07498244.pdf?arnumber=7498244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T22:00:43Z","timestamp":1718661643000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7498244\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/icde.2016.7498244","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}