Skip to content

Update README.adoc #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update README.adoc #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 3 additions & 2 deletions README.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,10 +10,11 @@ endif::[]
= Brutus

An API for performing brute force vector search backed by pre-computed data in
S3.
S3. Optimised for a large number of small indexes

== Why ?

toc::[]
Most existing vector search engines work by pre-indexing (compuationally expensive) data and storing these indexes in memory, this operation is optimised towards a small number of very large vector spaces. Brutus is different, it does no pre-indexing and generates all indexes at runtime. Thefore, Brutus is optimised to use cases when you have a very large number of small indexes. Pre-indexing is compuationally expensive but also only works well for large indexes. This precomuting redcues runtime complexity at the trade for indexing but this strategy only works well when there are a small number of vector spaces. When you have a large number of vector spaces you are better generating vectors at runtime


== Development
Expand Down