{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:03:06Z","timestamp":1760043786905,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030896560"},{"type":"electronic","value":"9783030896577"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-89657-7_11","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T21:02:48Z","timestamp":1634850168000},"page":"133-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Fair Approximate Nearest Neighbor Searches Using Threaded B+-Trees"],"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"}]},{"given":"Preeti","family":"Maurya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khandker Mushfiqul","family":"Islam","sequence":"additional","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,10,22]]},"reference":[{"key":"11_CR1","unstructured":"Agarwal, A., et al.: A reductions approach to fair classification. arXiv (2018)"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/3471485.3471496","volume":"50","author":"M Aum\u00fcller","year":"2021","unstructured":"Aum\u00fcller, M., et al.: Fair near neighbor search via sampling. SIGMOD Rec. 50(1), 42\u201349 (2021)","journal-title":"SIGMOD Rec."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Aum\u00fcller, M., et al.: Fair near neighbor search: Independent range sampling in high dimensions. In: SIGMOD (2020)","DOI":"10.1145\/3375395.3387648"},{"key":"11_CR4","unstructured":"Bera, S., et al.: Fair algorithms for clustering. In: NIPS (2019)"},{"issue":"3","key":"11_CR5","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(3), 273\u2013321 (2001)","journal-title":"CSUR"},{"key":"11_CR6","unstructured":"Chierichetti, F., et al.: Matroids, matchings, and fairness. In: AISTATS (2019)"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1089\/big.2016.0047","volume":"5","author":"A Chouldechova","year":"2017","unstructured":"Chouldechova, A.: Fair prediction with disparate impact: a study of bias in recidivism prediction instruments. Big Data 5(2), 153\u2013163 (2017)","journal-title":"Big Data"},{"key":"11_CR8","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":"11_CR9","unstructured":"Donini, M., et al.: Empirical risk minimization under fairness constraints. In: NIPS (2018)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Elzayn, H., et al.: Fair algorithms for learning in allocation problems. In: FAccT (2019)","DOI":"10.1145\/3287560.3287571"},{"key":"11_CR11","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":"11_CR12","unstructured":"Gionis, A., et al.: Similarity search in high dimensions via hashing. In: VLDB (1999)"},{"key":"11_CR13","unstructured":"Har-Peled, S., et al.: Near neighbor: who is the fairest of them all? In: NIPS (2019)"},{"key":"11_CR14","unstructured":"Hardt, M., et al.: Equality of opportunity in supervised learning. In: NIPS (2016)"},{"issue":"1","key":"11_CR15","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), 1\u201312 (2015)","journal-title":"VLDB"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-69377-0_6","volume-title":"Databases Theory and Applications","author":"O Jafari","year":"2021","unstructured":"Jafari, O., Nagarkar, P.: Experimental analysis of locality sensitive hashing techniques for high-dimensional approximate nearest neighbor searches. In: Qiao, M., Vossen, G., Wang, S., Li, L. (eds.) ADC 2021. LNCS, vol. 12610, pp. 62\u201373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-69377-0_6"},{"key":"11_CR17","unstructured":"Jafari, O., et al.: A survey on locality sensitive hashing algorithms and their applications. arXiv (2021)"},{"issue":"1","key":"11_CR18","first-page":"237","volume":"133","author":"J Kleinberg","year":"2018","unstructured":"Kleinberg, J., et al.: Human decisions and machine predictions. QJE 133(1), 237\u2013293 (2018)","journal-title":"QJE"},{"key":"11_CR19","unstructured":"Kleindessner, M., et al.: Guarantees for spectral clustering with fairness constraints. arXiv (2019)"},{"key":"11_CR20","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":"11_CR21","doi-asserted-by":"crossref","unstructured":"Lu, K., Kudo, M.: R2LSH: a nearest neighbor search scheme based on two-dimensional projected spaces. In: ICDE (2020)","DOI":"10.1109\/ICDE48307.2020.00095"},{"key":"11_CR22","unstructured":"Mehrabi, N., et al.: A survey on bias and fairness in machine learning. arXiv (2019)"},{"key":"11_CR23","unstructured":"MNIST (1998). http:\/\/yann.lecun.com\/exdb\/mnist"},{"key":"11_CR24","unstructured":"Seagate ST2000DM001 Manual (2011). https:\/\/www.seagate.com\/files\/staticfiles\/docs\/pdf\/datasheet\/disc\/barracuda-ds1737-1-1111us.pdf"},{"key":"11_CR25","unstructured":"SIFT (2004). http:\/\/corpus-texmex.irisa.fr"},{"issue":"5","key":"11_CR26","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(5), 643\u2013655 (2020)","journal-title":"VLDB"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89657-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T21:06:04Z","timestamp":1634850364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89657-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030896560","9783030896577"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89657-7_11","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":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sisap.org\/2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","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":"23","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":"5","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":"46% - 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,8","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":"3,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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}