co
CoSDR
Back to Blog
GuideJune 22, 2026

What is a Company DNA Vector? Representing Target Personas in High-Dimensional Semantic Space

What is a Company DNA Vector? Representing Target Personas in High-Dimensional Semantic Space
TL;DR Summary"Keyword-only lookups miss key prospects that use different words to describe the same pains. CoSDR uses text-embedding-004 to represent ICPs as high-dimensional semantic DNA vectors, executing low-latency local queries using pgvector 0.7 halfvec HNSW compression in PostgreSQL."

1. Topic Context & Definition

A Company DNA Vector is a mathematical representation of a business's technographic, firmographic, and pain-point characteristics within a high-dimensional vector space.

Moving Beyond Keyword Match Prospecting

Traditional B2B prospect filtering relies on rigid keyword matches. If a company describes its business using slightly different terms, standard search systems miss them. Modern outbound platforms solve this by converting target personas into high-dimensional semantic vectors. This enables highly advanced B2B lead finder techniques that bypass static, decayed datasets like those in our CoSDR vs Apollo comparison.

pgvector halfvec Compression in PostgreSQL

Storing high-dimensional vectors (768 or 1536 dimensions) requires substantial database memory. To optimize queries, CoSDR uses pgvector 0.7 halfvec (16-bit float) compression. This reduces the memory footprint of embeddings by exactly 50%, ensuring HNSW indexes reside in PostgreSQL shared buffers for fast local lookup.

Reciprocal Rank Fusion (RRF) Queries

To combine the benefits of semantic and keyword searches, CoSDR runs concurrent queries. The system merges keyword filters with vector similarity scores, combining results using Reciprocal Rank Fusion (RRF) in under 100 milliseconds to find the highest-affinity target accounts.

Frequently Asked Questions

Q: What is a Company DNA Vector?

It is a mathematical representation of a target company's business model, technographics, and pain points in a vector space.

Q: Why is semantic search superior to keyword matching?

Keyword matching misses companies that use synonyms. Semantic search matches targets based on business concept and pain point similarities.

Q: What is pgvector halfvec compression?

A PostgreSQL database compression technique that reduces vector memory size by 50%, speeding up vector indexes.

Q: How does CoSDR combine search results?

Using Reciprocal Rank Fusion (RRF) to merge and rank lexical keyword matches and vector similarity scores in under 100 milliseconds.

Q: What embedding model does CoSDR use?

CoSDR uses Google's text-embedding-004 model to generate 768-dimensional semantic profiles from target company inputs.