ITU

Fair near neighbor search via sampling

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

View graph of relations

Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. Given a set of points S and a radius parameter r > 0, the rnear neighbor (r-NN) problem asks for a data structure that, given any query point q, returns a point p within distance at most r from q. In this paper, we study the r-NN problem in the light of individual fairness and providing equal opportunities: all points that are within distance r from the query should have the same probability to be returned. In the low-dimensional case, this problem was first studied by Hu, Qiao, and Tao (PODS 2014). Locality sensitive hashing (LSH), the theoretically strongest approach to similarity search in high dimensions, does not provide such a fairness guarantee.
Original languageEnglish
JournalS I G M O D Record
Volume50
Issue number01
ISSN0163-5808
DOIs
Publication statusPublished - 2021

ID: 86407901