This demo shows how the vp-tree algorithm allows to search nearest neighbors in a huge database without actually comparing all items to the query.
This database includes loading... random cities. The size of the data is approximately 1.8 Mb. Including more cities would not make
the search really longer, but the full database + vp-tree data would take more than 100 Mb.
A naïve algorithm would compare the query coordinates to each one of the loading... cities to find the closest. With a vp-tree, only
≈ 100 comparisons are needed.