A fast way to look up the nearest hashes with hamming distance
Go to file
2023-02-10 23:14:29 -05:00
.github/workflows Fix build step. 2023-02-10 22:07:02 -05:00
bkapi chore: Release 2023-02-10 23:14:29 -05:00
bkapi-client chore: Release 2023-02-10 23:14:29 -05:00
.gitignore Add NATS option for notifications and searches. 2022-10-12 21:16:58 -04:00
Cargo.lock chore: Release 2023-02-10 23:14:29 -05: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.