top of page


How Data Structures Build the Bridge from Exact Matching to Semantic Search
Exact match is easy. Similarity is hard. This post climbs the ladder of structures that make vector lookups fast: linked lists (slow scans), skip lists (express lanes), small-world graphs, and HNSW. Then it shows how pgvector brings HNSW into PostgreSQL so entity resolution can happen where your records already live.

Gandhinath Swaminathan
Jan 58 min read
bottom of page