{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:02:04Z","timestamp":1758265324612,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030693763"},{"type":"electronic","value":"9783030693770"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-69377-0_6","type":"book-chapter","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T04:59:40Z","timestamp":1612933180000},"page":"62-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Experimental Analysis of Locality Sensitive Hashing Techniques for High-Dimensional Approximate Nearest Neighbor Searches"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3422-2755","authenticated-orcid":false,"given":"Omid","family":"Jafari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6284-9251","authenticated-orcid":false,"given":"Parth","family":"Nagarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,10]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Arora, A., et al.: HD-index: pushing the scalability-accuracy boundary for approximate kNN search. In: VLDB (2018)","DOI":"10.14778\/3204028.3204034"},{"key":"6_CR2","unstructured":"Babenko, A., et al.: Efficient indexing of billion-scale datasets of deep descriptors. In: CVPR (2016)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bawa, M., et al.: LSH forest: self-tuning indexes for similarity search. In: WWW (2005)","DOI":"10.1145\/1060745.1060840"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., et al.: Searching in metric spaces. CSUR 33, 273\u2013321 (2001)","journal-title":"CSUR"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"e1000498","DOI":"10.1371\/journal.pcbi.1000498","volume":"5","author":"SA Danziger","year":"2009","unstructured":"Danziger, S.A., et al.: Predicting positive P53 cancer rescue regions using most informative positive (MIP) active learning. PLoS Comput. Biol. 5, e1000498 (2009)","journal-title":"PLoS Comput. Biol."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Datar, M., et al.: Locality-sensitive hashing scheme based on p-stable distributions. In: SOCG (2004)","DOI":"10.1145\/997817.997857"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Gan, J., et al.: Locality-sensitive hashing scheme based on dynamic collision counting. In: SIGMOD (2012)","DOI":"10.1145\/2213836.2213898"},{"key":"6_CR8","unstructured":"Gionis, A., et al.: Similarity search in high dimensions via hashing. In: VLDB (1999)"},{"key":"6_CR9","first-page":"1","volume":"9","author":"Q Huang","year":"2015","unstructured":"Huang, Q., et al.: Query-aware locality-sensitive hashing for approximate nearest neighbor search. VLDB 9, 1\u201312 (2015)","journal-title":"VLDB"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2010","unstructured":"Jegou, H., et al.: Product quantization for nearest neighbor search. TPAMI 33, 117\u2013128 (2010)","journal-title":"TPAMI"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Kim, A., et al.: Optimally leveraging density and locality for exploratory browsing and sampling. In: HILDA (2018)","DOI":"10.1145\/3209900.3209903"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00778-017-0480-7","volume":"27","author":"V Leis","year":"2018","unstructured":"Leis, V., et al.: Query optimization through the looking glass, and what we found running the join order benchmark. VLDB 27, 643\u2013668 (2018)","journal-title":"VLDB"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Li, M., et al.: I\/O efficient approximate nearest neighbour search based on learned functions. In: ICDE (2020)","DOI":"10.1109\/ICDE48307.2020.00032"},{"key":"6_CR14","unstructured":"Li, W., et al.: Approximate nearest neighbor search on high dimensional data - experiments, analyses, and improvement. TKDE (2019)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Liu, W., et al.: I-LSH: I\/O efficient c-approximate nearest neighbor search in high-dimensional space. In: ICDE (2019)","DOI":"10.1109\/ICDE.2019.00169"},{"key":"6_CR16","first-page":"745","volume":"7","author":"Y Liu","year":"2014","unstructured":"Liu, Y., et al.: SK-LSH: an efficient index structure for approximate nearest neighbor search. VLDB 7, 745\u2013756 (2014)","journal-title":"VLDB"},{"key":"6_CR17","unstructured":"Loosli, G., et al.: Training invariant support vector machines using selective sampling. Large Scale Kernel Mach. (2007)"},{"key":"6_CR18","unstructured":"Lv, Q., et al.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: VLDB (2007)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s11263-007-0090-8","volume":"77","author":"BC Russell","year":"2008","unstructured":"Russell, B.C., et al.: LabelMe: a database and web-based tool for image annotation. IJCV 77, 157\u2013173 (2008)","journal-title":"IJCV"},{"key":"6_CR20","unstructured":"Seagate Barracuda 120 SSD Manual. https:\/\/www.seagate.com\/www-content\/datasheets\/pdfs\/barracuda-120-sata-DS2022-1-1909US-en_US.pdf"},{"key":"6_CR21","unstructured":"Seagate ST2000DM001 Manual. https:\/\/www.seagate.com\/files\/staticfiles\/docs\/pdf\/datasheet\/disc\/barracuda-ds1737-1-1111us.pdf"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Sun, Y., et al.: SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index. VLDB (2014)","DOI":"10.14778\/2735461.2735462"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1806907.1806912","volume":"35","author":"Y Tao","year":"2010","unstructured":"Tao, Y., et al.: Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. TODS 35, 1\u201346 (2010)","journal-title":"TODS"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1109\/TPAMI.2008.128","volume":"30","author":"A Torralba","year":"2008","unstructured":"Torralba, A., et al.: 80 million tiny images: a large data set for nonparametric object and scene recognition. TPAMI 30, 1958\u20131970 (2008)","journal-title":"TPAMI"},{"key":"6_CR25","first-page":"643","volume":"13","author":"B Zheng","year":"2020","unstructured":"Zheng, B., et al.: PM-LSH: a fast and accurate LSH framework for high-dimensional approximate NN search. VLDB 13, 643\u2013655 (2020)","journal-title":"VLDB"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69377-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T05:03:55Z","timestamp":1612933435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69377-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030693763","9783030693770"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69377-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dunedin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc2021.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}