Fair Near Neighbor Search: Independent Range Sampling in High Dimensions
Summary: Fair r-near-neighbor search guaranteeing equal-opportunity: every point within radius r has identical selection probability. Provides a black-box reduction turning any LSH into a uniform neighborhood sampler and a nearly-linear-space inner-product data structure using locality-sensitive filters, with experiments exposing LSH-induced unfairness. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Martin Aumüller (IT University of Copenhagen)
- 2. Rasmus Pagh (Basic Algorithms Research Copenhagen; IT University of Copenhagen)
- 3. Francesco Silvestri (University of Padova)
BibTeX Citation
@inproceedings{aumuller_pods20,
address = {New York, NY, USA},
series = {{PODS} '20},
title = {{Fair Near Neighbor Search: Independent Range Sampling in High Dimensions}},
url = {https://dl.acm.org/doi/10.1145/3375395.3387648},
doi = {10.1145/3375395.3387648},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Aumüller, Martin and Pagh, Rasmus and Silvestri, Francesco},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,453 | Querying in the Age of Graph Databases and Knowledge Graphs | 2021 | SIGMOD | 6.2137771e-05 |
| 5,527 | Algorithmic Techniques for Independent Query Sampling | 2022 | PODS | 6.1861709e-05 |
| 7,142 | Efficient Dynamic Weighted Set Sampling and Its Extension | 2024 | VLDB | 5.6917227e-05 |
| 8,790 | Practical Dynamic Extension for Sampling Indexes | 2023 | SIGMOD | 5.3722049e-05 |
| 10,238 | Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor | 2026 | SIGMOD | 5.093636e-05 |
| 10,244 | FIRAS: A Framework for Interval Range Search and Sampling | 2026 | SIGMOD | 5.093636e-05 |
| 11,174 | FairHash: A Fair and Memory/Time-efficient Hashmap | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,443 | Independent Range Sampling | 2014 | PODS | 8.5754434e-05 |
| 6,583 | Distance-Sensitive Hashing | 2018 | PODS | 5.8359922e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,259 | Efficient Dynamic Indexing for Range Filtered Approximate Nearest Neighbor Search | 2025 | SIGMOD |
| 2 | 11,174 | FairHash: A Fair and Memory/Time-efficient Hashmap | 2024 | SIGMOD |
| 3 | 690 | Efficient Similarity Search and Classification via Rank Aggregation | 2003 | SIGMOD |
| 4 | 580 | SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index | 2015 | VLDB |
| 5 | 2,158 | What is the nearest neighbor in high dimensional spaces? | 2000 | VLDB |
| 6 | 332 | Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search | 2016 | VLDB |
| 7 | 2,673 | DSH: Data Sensitive Hashing for High-Dimensional k-NN Search | 2014 | SIGMOD |
| 8 | 581 | Quality and Efficiency in High Dimensional Nearest Neighbor Search | 2009 | SIGMOD |
| 9 | 21 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB |
| 10 | 5,666 | Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search | 2015 | PODS |