这似乎是一项任务，其中 Vantage Point(VP树)可能会起作用...由于汉明距离应满足三角形不等式定理，因此您应该能够应用它...对于识别k最近的值也很有用.我已经在图像索引数据库设置中看到它了……您可以查看本文作为我正在谈论的内容的一个示例(尽管在不同的领域).

This seems like a task where a Vantage Point (VP tree) might work... since the hamming distance should satisfy the triangle inequality theorem, you should be able to apply it... its also good for identifying k-closest. I've seen it in image indexing database setups... you might check section 5 of this paper as an example of what I'm talking about (albeit in a different field).