A fast way to look up the nearest hashes with hamming distance
Go to file
Syfaro 365512b0c2 Major refactoring, better usage of NATS.
* Gracefully handle shutdowns.
* Support prefix for NATS subjects.
* Use NATS services for search.
* Much better use of NATS stream/consumers.
2023-08-14 23:17:16 -04:00
.github/workflows Fix build step. 2023-02-10 22:07:02 -05:00
bkapi Major refactoring, better usage of NATS. 2023-08-14 23:17:16 -04:00
bkapi-client Major refactoring, better usage of NATS. 2023-08-14 23:17:16 -04:00
.gitignore Move client nats behind feature. 2023-02-11 00:01:45 -05:00
Cargo.lock Major refactoring, better usage of NATS. 2023-08-14 23:17:16 -04:00
Cargo.toml Update versions, some cleanup. 2023-02-10 22:00:42 -05:00
README.md Initial commit. 2021-07-27 22:25:53 -04:00

bkapi

A fast way to look up hamming distance hashes.

It operates by connecting to a PostgreSQL database (DATABASE_URL), selecting every column of a provided query (DATABASE_QUERY), subscribing to events (DATABASE_SUBSCRIBE), and holding everything in a BK tree.

It provides a single API endpoint, /search which takes in a hash and distance query parameter to search for matches.