​
Basic Usage

Creating an HNSW index over a table can significantly improve query times.

Vectors can be searched using L2 distance, cosine distance, or inner product.

-- L2 distance
SELECT * FROM mock_items ORDER BY embedding <-> '[1,2,3]'::vector;

-- Cosine distance
SELECT * FROM mock_items ORDER BY embedding <=> '[1,2,3]'::vector;

-- Inner product
SELECT * FROM mock_items ORDER BY embedding <#> '[1,2,3]'::vector;

Under the hood, ParadeDB uses pgvector for similarity search. Please refer to the pgvector documentation for more details.

Was this page helpful?

Index CreationOverview