cppbktree VS aat

Interesting read. Especially the lookup method based on partitioning.

I tried to implement a similar reverse image search based on dHash as explained here https://github.com/Rayraegah/dhash . However, I also had lookup performance problems. Exact matches are not a problem but the Hamming distance threshold matching is. Because my project was in Python, I tried to eke out more performance by writing a BK-tree backend module in C++ https://github.com/mxmlnkn/cppbktree It was 2 to 10x faster than an existing similar module but still was too slow when trying to look up something in a database of millions of images. However, as lookup tended to depend on the exact Hamming-distance threshold value, my next step would have been to try and optimize the hash. E.g, make it shorter so that only a short Hamming distance is necessary to be looked up but the mentioned multi-indexing method looks much more promising and tested.

I would recommend just posting what you're looking to do. The API is pretty straightforward although there's not a large number of examples demonstrating its use. If you wanted to see an example of hooking IB into a trading system, I have one here https://github.com/AsyncAlgoTrading/aat/blob/bd61e8ec90a80d7a2208c5e68ec1414eed95ccf8/aat/exchange/public/ib/ib.py#L211