A fast way to look up the nearest hashes with hamming distance
Go to file
2022-10-12 23:19:15 -04:00
.github/workflows Remove old Sourcegraph actions step. 2022-10-12 16:39:01 -04:00
bkapi Improve error handling. 2022-10-12 23:19:15 -04:00
bkapi-client Add a client implementation. 2022-10-12 22:52:54 -04:00
.gitignore Add NATS option for notifications and searches. 2022-10-12 21:16:58 -04:00
Cargo.lock Bump versions. 2022-10-12 22:20:35 -04:00
Cargo.toml Add client. 2021-07-28 15:43:13 -04: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.