Probabilistic Proximity Searching Algorithms Based on Compact Partitions

  title={Probabilistic Proximity Searching Algorithms Based on Compact Partitions},
  author={Benjamin Bustos and Gonzalo Navarro},
  journal={J. Discrete Algorithms},
The main bottleneck of the research in metric space searching is the so-called curse of dimensionality, which makes the task of searching some metric spaces intrinsically difficult, whatever algorithm is used. A recent trend to break this bottleneck resorts to probabilistic algorithms, where it has been shown that one can find 99% of the elements at a fraction of the cost of the exact algorithm. These algorithms are welcome in most applications because resorting to metric space searching… CONTINUE READING