Home Projects vectorlite
vectorlite
C++

vectorlite

Fast, SQL powered, in-process vector search for any language with an SQLite driver

by 1yefuwang1 · GitHub
Stars
Forks
License
Created
Last commit
Category
Language
cpp17hnswpython3Apache-2.0C++
View on GitHub
In plain words

Perform fast searches for vector data using a SQL interface in any programming language that supports SQLite.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
vectorlite — GitHub preview card
📈 Star history
361360
2026-07-202026-08-31
📈 Track vectorlite

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

Fast, SQL powered, in-process vector search for any language with an SQLite driver

vectorlite has 360 stars on GitHub. It has been forked 10 times. vectorlite is written mainly in C++. It has been in active development since 2023. vectorlite is available under the Apache-2.0 license. Its main topics are cpp17, hnsw, python3, sqlite3.

Frequently asked questions

What is vectorlite?

Fast, SQL powered, in-process vector search for any language with an SQLite driver

Is vectorlite open source?

vectorlite is an open-source project. It is released under the Apache-2.0 license.

Is vectorlite free?

Yes. vectorlite is free and open source — you can use, modify and self-host it.

What license does vectorlite use?

vectorlite is available under the Apache-2.0 license.

What language is vectorlite written in?

vectorlite is written mainly in C++.

🏅 Maintainer of this project?
olud.ai badge — vectorlite

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=1yefuwang1-vectorlite)](https://olud.ai/project/1yefuwang1-vectorlite.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.