say i've got a large set of documents that contain perceptual hashes (around 35,000), what is the fastest way that I can (using mongodb) compare a given hash X to all the hashes in my database and find the ones with a distance less than N.
I'm using python by the way, I'm assuming this isn't possible natively in mongo, but maybe it is possible to optimize this somehow?