u/Remarkable_Art_6958

We are making progress with our native open source (MIT) C# database engine: https://db.relatude.com

(I've posted earlier about the engine, and thanks for the feedback so far!)

Have a look at this graphical UI for faceted searches: https://demo.db.relatude.com/graphql

(In the admin UI, you get more functionality, but it requires you clone the project and run locally )

This is just a quick example of some of the functionality that comes with the Relatude.DB nuget.

What do you think?

Any feedback is welcome! ( It is still early alpha .... )

https://preview.redd.it/krcxuup90gth1.png?width=2969&format=png&auto=webp&s=265b2cd7d4a980e8300e74ea0fc4545b16f54fd9

I've been researching different vector indexes recently for a database engine I am working on, here are my current findings, in case any one is interested:

I've so far looked into 3 algorithms in C#:

1. "Memory": a brute force all memory scan

2. "IVS": a disk based IVS implementation

3. "HNSW": a disk based HNSW implementation

Benchmarking is a difficult topic, as the variables are many, but as a first approximation my findings are:

• The memory index is the fastest for indexing ( obviously ) and works ok up to around 100k vectors. after that, search is slow and mem use very high.
• The IVS is fast on indexing, medium at search, but need very little memory.
• The HNWS is slow on indexing, needs more memory, but is the fastest for search

Here are some details on the current result: https://db.relatude.com/vector-matrix.html

( Please note, the whole project is still very much in early development )