{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T21:10:24Z","timestamp":1774127424968,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE23-0016"],"award-info":[{"award-number":["ANR-16-CE23-0016"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2023,11,1]]},"DOI":"10.1109\/tkde.2022.3232689","type":"journal-article","created":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T18:41:37Z","timestamp":1672339297000},"page":"11461-11475","source":"Crossref","is-referenced-by-count":4,"title":["GoldFinger: Fast & Approximate Jaccard for Efficient KNN Graph Constructions"],"prefix":"10.1109","volume":"35","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8187-724X","authenticated-orcid":false,"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2497-8770","authenticated-orcid":false,"given":"Guilhem","family":"Niot","sequence":"additional","affiliation":[{"name":"ENS de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6862-9046","authenticated-orcid":false,"given":"Olivier","family":"Ruas","sequence":"additional","affiliation":[{"name":"Pathway, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9692-5678","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Ta\u00efani","sequence":"additional","affiliation":[{"name":"Inria, CNRS, IRISA, University of Rennes, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41062-8_28"},{"key":"ref57","first-page":"521","article-title":"Distance metric learning with application to clustering with side-information","author":"xing","year":"2002","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498244"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303988"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"ref14","first-page":"21","article-title":"On the resemblance and containment of documents","author":"broder","year":"1997","journal-title":"Proc IEEE Conf Compression Complexity Sequences"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00306"},{"key":"ref53","first-page":"806","article-title":"Greedy hash: Towards fast optimization for accurate hash coding in CNN","author":"su","year":"2018","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/192844.192905"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2663165.2663315"},{"key":"ref55","author":"van rijsbergen","year":"1979","journal-title":"Information Retrieval"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1021\/ci600526a"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"ref18","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":"J Mach Learn Res"},{"key":"ref51","article-title":"Rapid AkNN query processing for fast classification of multidimensional data in the cloud","author":"nodarakis","year":"2014"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568017"},{"key":"ref46","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref45","first-page":"825","article-title":"An investigation of practical approximate nearest neighbor algorithms","author":"liu","year":"2005","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488466"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.54"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1352793.1352837"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1978542.1978566"},{"key":"ref49","author":"mcinnes","year":"0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739055"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_41"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16955-7_10"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33536-5_20"},{"key":"ref3","year":"0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"ref5","article-title":"PUFFINN: Parameterless and universally fast finding of nearest neighbors","author":"aum\u00fcller","year":"2019","journal-title":"Proc Annu Eur Symp Algorithms"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0131-7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1740390.1740395"},{"key":"ref36","article-title":"Hash functions","volume":"22","author":"jenkins","year":"1997","journal-title":"Dr Dobbs J"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/WICT.2011.6141295"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00195"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380184"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00186"},{"key":"ref2","year":"0"},{"key":"ref1","year":"0"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96983-1_30"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389711"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458172"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00120"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.67"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/148"},{"key":"ref27","author":"datasketch","year":"0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.3"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2591583"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10273671\/10003261.pdf?arnumber=10003261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T18:26:08Z","timestamp":1698085568000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10003261\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,1]]},"references-count":60,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2022.3232689","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,1]]}}}