<p>There are a lot of heuristic approaches, but if you want something really state of the art, check <a href="https://arxiv.org/abs/1812.02603" rel="nofollow noreferrer" title="Confirmation Sampling for Exact Nearest Neighbor Search">"Confirmation Sampling for Exact Nearest Neighbor Search"</a>.</p>
LSH: solve the EXACT Near Neighbor Search?
<p>I'm curious if it's possible to find exact match using LSH.
On MIT website about LSH they state: </p>

<blockquote>
  <p>Locality-Sensitive Hashing (LSH) is an algorithm for solving the approximate or <strong>exact</strong> Near Neighbor Search in high dimensional spaces</p>
</blockquote>

<p><a href="https://www.mit.edu/~andoni/LSH/" rel="nofollow noreferrer">https://www.mit.edu/~andoni/LSH/</a></p>

<p>I kinda made some search around internet and google scholar but it seems like there's no sign about it. Is there anyone know if it's possible and can point me to the paper about it? Much appreciated. </p>