Milvus VS bleve

Zilliz (zilliz.com) | Hybrid/ONSITE (SF, NYC) | Full-time

I am part of the hiring team for DevRel

NYC - https://boards.greenhouse.io/zilliz/jobs/4307910005

SF - https://boards.greenhouse.io/zilliz/jobs/4317590005

Zilliz is the company behind Milvus (https://github.com/milvus-io/milvus), the most starred vector database on GitHub. Milvus is a distributed vector database that shines in 1B+ vector use cases. Examples include autonomous driving, e-commerce, and drug discovery. (and, of course, RAG)

We are also hiring for other roles that I am not personally involved in the hiring process for such as product managers, software engineers, and recruiters.

Get started with Milvus on GitHub.

Milvus: An open-source vector database designed for AI and ML applications. It excels in handling large-scale vector similarity searches, making it suitable for recommendation systems, image and video retrieval, and natural language processing tasks.

Selecting the right version of open-source Milvus is important to the success of any project leveraging vector search technology. With Milvus offering different versions of its vector database tailored to varying requirements, understanding the significance of selecting the correct version is key for achieving desired outcomes.

Milvus is an open-source vector database designed to handle large-scale similarity search and vector indexing. It supports multiple index types and offers highly efficient search capabilities, making it suitable for a wide range of AI and ML applications, including image and video recognition, natural language processing, and recommendation systems.

Zilliz is hiring! We're looking for REMOTE and/or HYBRID roles in SF

Zilliz is the company behind Milvus (https://github.com/milvus-io/milvus), the most widely adopted vector database. Vector databases are a crucial piece of any technology stack looking to take advantage of unstructured data. Most recently and notably, Retrieval Augmented Generation (RAG). For RAG, vector databases like Milvus are used as the tool to inject customized data. In other words, vector databases make things like customized chat bots, personalized product recommendations, and more possible.

We are hiring for Developer Advocates, Senior+ Level Engineers and Product people, and Talent Acquisition. Check out all the roles here: https://zilliz.com/careers

Good on them, I know the crustaceans are out here happy about this raise for a Rust based Vector DB!

(now I'm gonna plug what I work on)

If you're interested in a more scalable vector database written in Go, check out Milvus (https://github.com/milvus-io/milvus)

But before we do, I do want to say that 🤩 all these lovely Open-Source projects would love a little 🎉💕 love by getting a GitHub star ⭐ for their efforts. Including Open Source Milvus 🥰

1. Milvus by Zilliz | Github

I don't have the answer to that, but the project has been alive for many years. Seems maybe you should find the answer since you are developing a competing solution? Also it might be a good reference project for solving similar problems to yours. They do have bench tests you could play with https://github.com/blevesearch/bleve/blob/master/query_bench_test.go

I know of https://github.com/blevesearch/bleve and I think there was another project for full text search that I can't find now.

I would be interested in such a testbed. I would also like to know how Bleve Search (https://github.com/blevesearch/bleve) turns out.

I have for many years now a small search engine project in my free-time pipeline, but I'm before crawling even and I intend to sit for searching part after some of that.

Haha. Seriously I can’t tell the difference between these libraries https://github.com/blevesearch/bleve

I've never worked on a project that encompasses as many computer science algorithms as a search engine. There are a lot of topics you can lookup in "Information Storage and Retrieval":

- Tries (patricia, radix, etc...)

- Trees (b-trees, b+trees, merkle trees, log-structured merge-tree, etc..)

- Consensus (raft, paxos, etc..)

- Block storage (disk block size optimizations, mmap files, delta storage, etc..)

- Probabilistic filters (hyperloloog, bloom filters, etc...)

- Binary Search (sstables, sorted inverted indexes, roaring bitmaps)

- Ranking (pagerank, tf/idf, bm25, etc...)

- NLP (stemming, POS tagging, subject identification, sentiment analysis etc...)

- HTML (document parsing/lexing)

- Images (exif extraction, removal, resizing / proxying, etc...)

- Queues (SQS, NATS, Apollo, etc...)

- Clustering (k-means, density, hierarchical, gaussian distributions, etc...)

- Rate limiting (leaky bucket, windowed, etc...)

- Compression

- Applied linear algebra

- Text processing (unicode-normalization, slugify, sanitation, lossless and lossy hashing like metaphone and document fingerprinting)

- etc...

I'm sure there is plenty more I've missed. There are lots of generic structures involved like hashes, linked-lists, skip-lists, heaps and priority queues and this is just to get 2000's level basic tech.

- https://github.com/quickwit-oss/tantivy

- https://github.com/valeriansaliou/sonic

- https://github.com/mosuka/phalanx

- https://github.com/meilisearch/MeiliSearch

- https://github.com/blevesearch/bleve

- https://github.com/thomasjungblut/go-sstables

A lot of people new to this space mistakenly think you can just throw elastic search or postgres fulltext search in front of terabytes of records and have something decent. The problem is that search with good rankings often requires custom storage so calculations can be sharded among multiple nodes and you can do layered ranking without passing huge blobs of results between systems.

For those curious, I'm on my 3rd search engine as I keep discovering new methods of compactly and efficiently processing and querying results.

There isn't a one-size-fits all approach, but I've never worked on a project that encompasses as many computer science algorithms as a search engine.

- Tries (patricia, radix, etc...)

- Trees (b-trees, b+trees, merkle trees, log-structured merge-tree, etc..)

- Consensus (raft, paxos, etc..)

- Block storage (disk block size optimizations, mmap files, delta storage, etc..)

- Probabilistic filters (hyperloloog, bloom filters, etc...)

- Binary Search (sstables, sorted inverted indexes)

- Ranking (pagerank, tf/idf, bm25, etc...)

- NLP (stemming, POS tagging, subject identification, etc...)

- HTML (document parsing/lexing)

- Images (exif extraction, removal, resizing / proxying, etc...)

- Queues (SQS, NATS, Apollo, etc...)

- Clustering (k-means, density, hierarchical, gaussian distributions, etc...)

- Rate limiting (leaky bucket, windowed, etc...)

- text processing (unicode-normalization, slugify, sanitation, lossless and lossy hashing like metaphone and document fingerprinting)

- etc...

I'm sure there is plenty more I've missed. There are lots of generic structures involved like hashes, linked-lists, skip-lists, heaps and priority queues and this is just to get 2000's level basic tech.

- https://github.com/quickwit-oss/tantivy

- https://github.com/valeriansaliou/sonic

- https://github.com/mosuka/phalanx

- https://github.com/meilisearch/MeiliSearch

- https://github.com/blevesearch/bleve

A lot of people new to this space mistakenly think you can just throw elastic search or postgres fulltext search in front of terabytes of records and have something decent. That might work for something small like a curated collection of a few hundred sites.

Search in SQL databases is a tough beast to get it right. And given that we support MySQL and Postgres both, it gets even harder to support quirks of both of them.

In enterprise editions, the only addition is Elasticsearch. But in our open-source version, we do have support for https://github.com/blevesearch/bleve. Although, it's in beta, we have a lot of customers using it.

I am wondering if you have tried using it and didn't like it?