In Similarity Search (SS), given a new piece of data (or a query), often a close enough match to it from a given set of data points is sought. One view of SS is that the query is assumed to be a noise corrupted data point. In line with this view, François et. al. [1] argue that the Euclidean norm and fractional distances give better search results in the case of white noise and highly coloured noise, respectively. Further, Singh and Jayaram [2] showed that the fractional distances work well even when the noise is not-so-highly coloured. In this work, we attempt to determine if fractional distances could be made to work in the setting of SS even when the noise is white. The real challenges lie in the many counter-intuitive phenomena in high dimensional spaces which will be discussed briefly and our approach in tackling them will also be discussed in this work. © 2022 Owner/Author.