Lantern is an open-source PostgreSQL database extension to store vector data, generate embeddings, and handle vector search operations.
It provides a new index type for vector columns called lantern_hnsw
which speeds up ORDER BY ... LIMIT
queries.
Lantern builds and uses usearch, a single-header state-of-the-art HNSW implementation.
If you don’t have PostgreSQL already, use Lantern with Docker to get started quickly:
docker run --pull=always --rm -p 5432:5432 -e "POSTGRES_USER=$USER" -e "POSTGRES_PASSWORD=postgres" -v ./lantern_data:/var/lib/postgresql/data lanterndata/lantern:latest-pg15
Then, you can connect to the database via postgresql://$USER:postgres@localhost/postgres
.
To install Lantern using homebrew
:
brew tap lanterndata/lantern
brew install lantern && lantern_install
You can also install Lantern on top of PostgreSQL from our precompiled binaries via a single make install
.
Alternatively, you can use Lantern in one click using Replit.
Prerequisites:
cmake version: >=3.3
gcc && g++ version: >=11 when building portable binaries, >= 12 when building on new hardware or with CPU-specific vectorization
PostgreSQL 11, 12, 13, 14, 15 or 16
Corresponding development package for PostgreSQL (postgresql-server-dev-$version)
To build Lantern on new hardware or with CPU-specific vectorization:
git clone --recursive https://github.com/lanterndata/lantern.git
cd lantern
cmake -DMARCH_NATIVE=ON -S lantern_hnsw -B build
make -C build install -j
To build portable Lantern binaries:
git clone --recursive https://github.com/lanterndata/lantern.git
cd lantern
cmake -DMARCH_NATIVE=OFF -S lantern_hnsw -B build
make -C build install -j
Lantern retains the standard PostgreSQL interface, so it is compatible with all of your favorite tools in the PostgreSQL ecosystem.
First, enable Lantern in SQL (e.g. via psql
shell)
CREATE EXTENSION lantern;
Note: After running the above, lantern extension is only available on the current postgres DATABASE (single postgres instance may have multiple such DATABASES). When connecting to a different DATABASE, make sure to run the above command for the new one as well. For example:
CREATE DATABASE newdb;
\c newdb
CREATE EXTENSION lantern;
Create a table with a vector column and add your data
CREATE TABLE small_world (id integer, vector real[3]);
INSERT INTO small_world (id, vector) VALUES (0, '{0,0,0}'), (1, '{0,0,1}');
Create an hnsw index on the table via lantern_hnsw
:
CREATE INDEX ON small_world USING lantern_hnsw (vector);
Customize lantern_hnsw
index parameters depending on your vector data, such as the distance function (e.g., dist_l2sq_ops
), index construction parameters, and index search parameters.
CREATE INDEX ON small_world USING lantern_hnsw (vector dist_l2sq_ops)
WITH (M=2, ef_construction=10, ef=4, dim=3);
Start querying data
SET enable_seqscan = false;
SELECT id, l2sq_dist(vector, ARRAY[0,0,0]) AS dist
FROM small_world ORDER BY vector <-> ARRAY[0,0,0] LIMIT 1;
Lantern supports several distance functions in the index
There are 3 operators available <->
(l2sq), <=>
(cosine), <+>
(hamming).
There are four defined operator classes that can be employed during index creation:
dist_l2sq_ops
: Default for the type real[]
dist_vec_l2sq_ops
: Default for the type vector
dist_cos_ops
: Applicable to the type real[]
dist_vec_cos_ops
: Applicable to the type vector
dist_hamming_ops
: Applicable to the type integer[]
The M
, ef
, and ef_construction
parameters control the performance of the HNSW algorithm for your use case.
M
and ef_construction
speed up index creation at the cost of recall.M
and ef
improve search speed and result in fewer shared buffer hits at the cost of recall. Tuning these parameters will require experimentation for your specific use case.git pull && git submodule update --recursive
Important takeaways:
CREATE INDEX
time, SELECT
throughput, and SELECT
latency.