Below are the free Exam Prep Hubs currently available on The Data Community. Bookmark the hubs you are interested in and use them to ensure you are fully prepared for the respective exam.
Each hub contains:
The topic-by-topic (from the official study guide) coverage of the material, making it easy for you to ensure you are covering all aspects of the exam material.
Practice exam questions for each section.
Bonus material to help you prepare
Two (2) Practice Exams with 60 questions each, or Four (4) Practice Exams with 30 questions each – along with answers.
Links to useful resources, such as Microsoft Learn content, YouTube video series, and more.
WARNING: AI-900 will retire on June 30, 2026. It will be replaced with AI-901. You can continue to earn this certification after AI-900 retires by passing AI-901.
Welcome to The Data Community! A great online resource for information centered around the broad and important topic of “data”. Thank you for visiting and participating.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Choose from full-text, semantic vector, and hybrid search
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
One of the most important skills measured on the DP-800 exam is knowing which search technology is appropriate for different AI-enabled database scenarios. Modern applications no longer rely solely on keyword matching. Instead, they increasingly combine traditional SQL capabilities with semantic understanding powered by embeddings and vector databases.
Microsoft SQL Server 2025, Azure SQL Database, Azure SQL Managed Instance, Azure AI Search, and Microsoft Fabric all support architectures that combine relational data with AI-powered retrieval.
The DP-800 exam expects candidates to understand:
Traditional Full-Text Search
Semantic Vector Search
Hybrid Search
When each technique should be selected
Advantages and disadvantages of each approach
How embeddings enable semantic retrieval
How intelligent search supports Retrieval-Augmented Generation (RAG)
Understanding the strengths and weaknesses of each search strategy is critical because choosing the wrong approach can significantly reduce application quality, increase cost, or degrade performance.
Why Intelligent Search Matters
Traditional databases are excellent at retrieving structured information.
For example:
Find all customers named Smith.
or
Find invoices created after January 1.
However, AI applications often ask questions like:
Which support ticket is similar to this one?
Find documents about password recovery.
Find articles discussing authentication failures.
Recommend products similar to this description.
These questions require understanding meaning, not merely matching characters.
This is why semantic search has become an essential component of modern database applications.
Three Primary Search Approaches
Microsoft generally categorizes intelligent search into three approaches:
Full-Text Search
Semantic Vector Search
Hybrid Search
Each solves a different problem.
Full-Text Search
Full-text search is Microsoft’s traditional text search technology.
Instead of scanning every row with LIKE comparisons, SQL Server builds specialized indexes that understand words and language.
Example:
Find all documents containing:
database
security
Azure
Rather than performing:
WHERE Description LIKE '%Azure%'
Full-text indexes tokenize words and search efficiently.
Full-Text Search Features
Supports:
Word searches
Phrase searches
Prefix searches
Inflectional forms
Language-specific stemming
Stop words
Ranking
Example:
Searching for
run
may also find
running
runs
ran
depending on language settings.
Full-Text Index Architecture
A full-text index stores:
Tokens
Word locations
Linguistic metadata
instead of raw text.
This allows much faster retrieval than LIKE queries.
Common Full-Text Functions
Examples include:
CONTAINS()
FREETEXT()
CONTAINSTABLE()
FREETEXTTABLE()
Example:
SELECT*
FROM Articles
WHERE CONTAINS(Content,'Azure');
Advantages of Full-Text Search
Advantages include:
Mature technology
Extremely fast keyword searches
Built directly into SQL Server
Efficient indexing
Supports ranking
Low storage overhead
Easy implementation
Limitations of Full-Text Search
It still relies primarily on matching words.
It does not understand meaning.
For example:
Search:
vehicle repair
A document containing
automobile maintenance
might not be returned.
Although synonyms can sometimes help, semantic understanding remains limited.
When Full-Text Search Is Best
Choose Full-Text Search when:
Exact words matter
Legal document searches
Product catalogs
Article searches
Documentation portals
Knowledge bases
Compliance systems
It excels when users know the terminology they are searching for.
Semantic Vector Search
Vector search is fundamentally different.
Instead of searching words, it searches meaning.
The process is:
Text
↓
Embedding model
↓
Vector
↓
Similarity search
Every document becomes a numerical representation.
Example:
"Reset your password"
becomes
[0.183,
-0.912,
0.447,
...]
The numbers themselves are not important.
Their relative position in vector space is.
Embeddings Power Semantic Search
Embedding models place similar concepts near each other.
For example:
Dog
and
Puppy
produce vectors close together.
Likewise:
Laptop
and
Notebook computer
may generate highly similar vectors.
The model learns semantic relationships.
Similarity Search
Rather than asking:
“Does this document contain this word?”
Vector search asks:
“Which vectors are closest?”
Similarity is commonly measured using:
Cosine similarity
Euclidean distance
Dot product
Cosine similarity is the most common metric.
Example
User asks:
“How do I recover my account?”
Stored article:
“Reset your password”
Even though no identical words exist, vector search recognizes the concepts are related.
This is impossible using ordinary keyword matching.
Advantages of Semantic Vector Search
Benefits include:
Understands meaning
Finds similar content
Supports natural language
Excellent for AI assistants
Ideal for RAG
Handles synonyms automatically
Better user experience
Limitations of Vector Search
Tradeoffs include:
Requires embedding models
Consumes more storage
Embedding generation costs compute
Requires vector indexes
More complex infrastructure
Results can occasionally be less predictable than exact keyword searches
Typical Use Cases
Vector search is ideal for:
AI chatbots
Enterprise search
Recommendation engines
Similar document retrieval
Customer support assistants
Semantic knowledge bases
Question answering systems
RAG architectures
Understanding Hybrid Search
Neither full-text nor vector search is perfect for every workload.
Hybrid search combines both approaches.
Instead of choosing one search method, the application performs:
Full-text search
Vector search
simultaneously.
Results are then merged and ranked.
This provides higher-quality search than either technique alone.
Why Hybrid Search Works
Imagine a user searches:
“Azure SQL backup”
Keyword search finds:
Azure SQL backup documentation
Vector search finds:
Disaster recovery guidance
Database restore procedures
Business continuity articles
Combining both returns a richer, more relevant result set.
Benefits of Hybrid Search
Hybrid search offers:
Higher recall
Better ranking
Exact keyword matches
Semantic understanding
More complete search results
Improved user satisfaction
Better grounding for AI responses
Hybrid Search in RAG
Retrieval-Augmented Generation depends heavily on retrieving the most relevant context.
Hybrid search often performs best because it retrieves:
Exact terminology
Related concepts
Similar documents
The LLM then generates an answer using higher-quality evidence.
This significantly reduces hallucinations.
Choosing the Right Search Method
Requirement
Best Choice
Exact keywords
Full-Text Search
SQL documentation search
Full-Text Search
Product SKU lookup
Full-Text Search
Semantic similarity
Vector Search
AI chatbot
Vector Search
Recommendation engine
Vector Search
RAG system
Hybrid Search
Enterprise search
Hybrid Search
Large knowledge base
Hybrid Search
Customer support assistant
Hybrid Search
Comparison Table
Feature
Full-Text
Vector
Hybrid
Keyword matching
Excellent
Poor
Excellent
Semantic understanding
No
Yes
Yes
Finds synonyms
Limited
Excellent
Excellent
Natural language queries
Limited
Excellent
Excellent
Requires embeddings
No
Yes
Yes
Requires vector index
No
Yes
Yes
Best for RAG
Fair
Good
Excellent
AI chatbot support
Limited
Excellent
Excellent
Traditional SQL workloads
Excellent
Moderate
Good
Complexity
Low
Medium
Higher
DP-800 Exam Tips
Remember these key distinctions:
Full-text search is optimized for exact words and phrases.
Vector search retrieves semantically similar content using embeddings.
Hybrid search combines keyword precision with semantic relevance.
Embeddings are required only for vector and hybrid search.
Hybrid search is generally the preferred approach for enterprise AI assistants and RAG solutions because it balances precision and recall.
LIKE queries are not substitutes for full-text indexes in large-scale search applications.
Expect scenario-based questions asking you to recommend the most appropriate search technology based on application requirements, performance, and user experience.
Practice Exam Questions
Question 1
A development team is building an enterprise knowledge base for an AI chatbot. Users ask questions in natural language, and the chatbot retrieves relevant documents before generating a response.
Which search approach should you recommend?
A. Full-text search only
B. Semantic vector search
C. LIKE queries
D. Indexed views
Correct Answer:B
Explanation: Semantic vector search uses embeddings to retrieve documents based on meaning rather than exact keywords. This makes it ideal for AI chatbots and Retrieval-Augmented Generation (RAG). LIKE queries and indexed views do not provide semantic understanding, while full-text search is limited to keyword matching.
Question 2
A legal department maintains millions of contracts. Attorneys usually know the exact legal terms they are searching for and require fast, precise keyword matching.
Which search technology is the best fit?
A. Hybrid search
B. Semantic vector search
C. Full-text search
D. Azure AI embeddings only
Correct Answer:C
Explanation: Full-text search is optimized for exact words, phrases, stemming, ranking, and efficient indexing. Since attorneys typically search using precise terminology, full-text search provides the best balance of performance and accuracy.
Question 3
A company stores product manuals and wants search results to include documents discussing “automobile maintenance” when users search for “car repair.”
Which search capability provides this behavior?
A. SQL LIKE operator
B. Clustered indexes
C. Full-text search only
D. Semantic vector search
Correct Answer:D
Explanation: Semantic vector search retrieves content based on meaning instead of exact words. Because embedding models understand semantic relationships, they recognize that “car repair” and “automobile maintenance” describe similar concepts.
Question 4
A RAG application must retrieve documents that contain both exact product names and semantically similar troubleshooting articles.
Which search strategy should you recommend?
A. Full-text search
B. LIKE queries
C. Hybrid search
D. Clustered columnstore indexes
Correct Answer:C
Explanation: Hybrid search combines full-text search with semantic vector search. Exact product names are retrieved through keyword matching, while related troubleshooting content is found using semantic similarity.
Question 5
Which characteristic is unique to semantic vector search?
A. It stores documents in XML format.
B. It searches using vector similarity instead of exact text matching.
C. It requires clustered indexes.
D. It eliminates the need for embeddings.
Correct Answer:B
Explanation: Semantic vector search converts content into embeddings and compares vectors using similarity metrics such as cosine similarity. It does not rely on exact text matching.
Question 6
Your application must support searches for:
“running”
“runs”
“ran”
using a single search term.
Which technology provides this capability without AI embeddings?
A. Full-text search
B. Azure OpenAI
C. Semantic vector search
D. Azure AI Search only
Correct Answer:A
Explanation: Full-text search supports stemming and inflectional forms, allowing different grammatical variations of a word to match automatically without requiring embeddings.
Question 7
Which similarity metric is most commonly associated with vector search?
A. SHA-256
B. CRC32
C. Cosine similarity
D. Binary comparison
Correct Answer:C
Explanation: Cosine similarity is the most widely used metric for measuring how similar two embedding vectors are by comparing the angle between them rather than their magnitude.
Question 8
An organization wants users to receive highly relevant search results even when they misspell keywords or use different terminology.
Which search method generally provides the highest quality results?
A. LIKE queries
B. Full-text search only
C. Hybrid search
D. Primary key lookups
Correct Answer:C
Explanation: Hybrid search combines keyword matching with semantic understanding, improving recall and relevance by returning both exact matches and conceptually related documents.
Question 9
A database developer asks why embeddings are required for semantic search.
What is the primary purpose of embeddings?
A. Encrypt database rows.
B. Compress database backups.
C. Replace SQL indexes.
D. Represent content numerically so semantic similarity can be calculated.
Correct Answer:D
Explanation: Embeddings transform text into high-dimensional numerical vectors that capture semantic meaning. Similar vectors represent similar concepts, enabling semantic search.
Question 10
Which scenario is the strongest candidate for using hybrid search instead of only full-text search?
A. Searching employee IDs
B. Retrieving rows by primary key
C. Supporting an AI assistant that answers questions using company documentation
D. Looking up invoice numbers
Correct Answer:C
Explanation: AI assistants benefit from hybrid search because they require both exact keyword matching and semantic understanding. Hybrid search improves document retrieval quality, which directly improves the quality of RAG-generated responses.
DP-800 Exam Tips
Full-text search is best for exact keywords, phrases, and language-aware searches using stemming and ranking.
Semantic vector search retrieves information based on meaning by comparing embeddings with similarity metrics such as cosine similarity.
Hybrid search combines keyword precision with semantic relevance and is generally the preferred approach for enterprise AI search and RAG solutions.
Embeddings are required for vector and hybrid search but not for traditional full-text search.
Expect scenario-based exam questions where you must recommend the most appropriate search technology based on user requirements, data type, query style, and application architecture.
Remember that LIKE queries are suitable only for simple pattern matching and are not a replacement for full-text or semantic search in large-scale intelligent applications.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Implement full-text search
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
Full-text search is one of the foundational search technologies available in Microsoft SQL Server and Azure SQL Managed Instance. Unlike traditional SQL searches that rely on exact text matching through operators such as LIKE, full-text search provides a much more efficient and intelligent mechanism for searching large collections of textual data.
For the DP-800: Developing AI-Enabled Database Solutions exam, you should understand:
What full-text search is
When it should be used
How it works internally
Full-text indexes and catalogs
Supported query predicates and functions
Language-aware searching
Stoplists and thesaurus files
Ranking search results
Performance considerations
When to choose full-text search instead of vector or hybrid search
Although AI-powered semantic search is becoming increasingly popular, full-text search remains an important technology for applications that require fast keyword-based retrieval.
What Is Full-Text Search?
Full-text search is a SQL Server feature that enables efficient searching of large text columns.
Unlike:
WHERE Description LIKE'%backup%'
full-text search creates a specialized index that understands words rather than simple character sequences.
It supports searching within:
CHAR
VARCHAR
NCHAR
NVARCHAR
TEXT (legacy)
NTEXT (legacy)
XML
FILESTREAM documents through filters
Instead of scanning every row, SQL Server searches an optimized full-text index.
Why Traditional LIKE Queries Are Limited
Many developers initially use:
SELECT*
FROM Articles
WHERE Content LIKE'%security%'
Although this works, it has several disadvantages:
Table scans on large datasets
Poor performance
Cannot rank results
No language awareness
No stemming
No synonym support
Limited search capabilities
For enterprise search applications, LIKE queries do not scale effectively.
Benefits of Full-Text Search
Full-text search provides:
Fast keyword searches
Phrase searching
Prefix matching
Inflectional searches
Linguistic processing
Word breaking
Ranking of results
Stop word removal
Efficient indexing
Large-scale text retrieval
Full-Text Search Architecture
Several components work together.
Source Tables
Contain text data.
Example:
Articles
Products
KnowledgeBase
SupportTickets
Policies
Full-Text Index
Instead of indexing every character, SQL Server stores:
Tokens
Word positions
Language metadata
This dramatically speeds searches.
Full-Text Catalog
A full-text catalog is a logical container for one or more full-text indexes.
Modern SQL Server versions automatically manage catalogs, but understanding the concept remains important for the DP-800 exam.
Word Breakers
SQL Server separates text into words using language-specific rules.
Example:
SQL Server enables intelligent search.
becomes
SQL
Server
enables
intelligent
search
Different languages use different tokenization rules.
Stemmers
Stemmers recognize grammatical variations.
Searching:
run
may also find
running
runs
ran
depending on the configured language.
Enabling Full-Text Search
Before using full-text search:
Install Full-Text Search feature.
Create a unique key index.
Create a full-text catalog (optional in newer versions).
Create a full-text index.
Example:
CREATE FULLTEXT INDEX
ON Articles(Content)
KEY INDEX PK_Articles;
The index is then populated.
Full-Text Predicates
The DP-800 exam expects familiarity with common predicates.
CONTAINS()
Searches for precise words or phrases.
Example:
SELECT*
FROM Articles
WHERE CONTAINS(Content,'Azure');
Phrase Search
CONTAINS(Content,'"Azure SQL"')
Returns only rows containing the complete phrase.
Boolean Operators
Supports:
AND
OR
AND NOT
Example:
CONTAINS(Content,'"Azure" AND "Backup"')
Prefix Search
CONTAINS(Content,'"cloud*"')
Matches
cloud
clouds
cloud-based
clouding
Proximity Search
Finds words located near each other.
Example:
database NEAR backup
Useful when context matters.
FREETEXT()
Unlike CONTAINS(), FREETEXT searches for the meaning of words rather than exact expressions.
Example:
SELECT*
FROM Articles
WHERE FREETEXT(Content,'database recovery');
SQL Server automatically considers:
synonyms
stemming
inflectional forms
It is more natural-language oriented than CONTAINS().
Ranking Results
Often multiple documents match.
SQL Server can assign relevance rankings.
Functions include:
CONTAINSTABLE()
FREETEXTTABLE()
Example:
SELECT*
FROM CONTAINSTABLE
(
Articles,
Content,
'Azure'
)
Returns:
KEY
RANK
Applications can sort using the ranking score.
Stoplists
Certain words appear so frequently that indexing them offers little value.
Examples:
the
is
and
a
of
These are called stop words.
Stoplists improve:
Index size
Query performance
Search quality
Custom stoplists may also be created.
Thesaurus Files
SQL Server supports synonym expansion through thesaurus XML files.
Example:
Searching:
car
may automatically include
automobile
vehicle
This improves keyword searches without requiring embeddings.
Supported Languages
Full-text search supports dozens of languages.
Language-specific processing includes:
tokenization
stemming
stop words
word breakers
Examples include:
English
French
German
Spanish
Japanese
Chinese
Each language has its own linguistic rules.
Maintaining Full-Text Indexes
Indexes require updates when data changes.
Population modes include:
Full Population
Rebuilds the entire index.
Suitable for:
initial creation
major updates
Automatic Change Tracking
Automatically updates the index after data modifications.
Recommended for most OLTP workloads.
Manual Population
Administrators trigger updates manually.
Useful when:
large batch loads occur
maintenance windows exist
Performance Considerations
Full-text search is highly optimized but requires planning.
Consider:
index storage
population time
update frequency
large document sizes
language configuration
stoplists
For massive document repositories, automatic population should be monitored to avoid excessive resource usage.
When to Use Full-Text Search
Choose full-text search when users search by:
keywords
phrases
document titles
product names
legal terminology
technical documentation
Examples:
Knowledge bases
Product catalogs
Documentation portals
Legal document repositories
Medical reference systems
When NOT to Use Full-Text Search
Full-text search is not ideal when users expect semantic understanding.
Example:
User searches:
“recover my account”
Stored document:
“reset your password”
These phrases contain different words.
Full-text search may not match them effectively.
Semantic vector search would perform much better.
Full-Text Search vs LIKE
Feature
LIKE
Full-Text Search
Performance
Poor on large tables
Excellent
Uses indexes
Limited
Specialized full-text indexes
Phrase search
Limited
Yes
Word stemming
No
Yes
Stop words
No
Yes
Ranking
No
Yes
Prefix search
Limited
Yes
Language awareness
No
Yes
Full-Text Search vs Semantic Vector Search
Feature
Full-Text
Vector Search
Keyword matching
Excellent
Limited
Semantic understanding
No
Excellent
Embeddings required
No
Yes
Natural language
Limited
Excellent
Synonym understanding
Limited
Excellent
AI chatbot support
Moderate
Excellent
RAG support
Moderate
Excellent
Complexity
Low
Medium
Common DP-800 Scenarios
Scenario 1
A legal team searches contracts using exact legal terminology.
Best solution: Full-text search.
Scenario 2
A documentation portal searches millions of technical articles.
Best solution: Full-text search.
Scenario 3
An AI assistant answers questions using company documentation.
Best solution: Hybrid search (full-text + vector search).
Scenario 4
A recommendation engine finds similar documents.
Best solution: Vector search.
Best Practices
Use full-text indexes instead of LIKE for large text searches.
Configure the correct language for linguistic processing.
Enable automatic change tracking for frequently updated data.
Use stoplists to reduce index size and improve relevance.
Use CONTAINS() for precise searches and FREETEXT() for natural-language style queries.
Use CONTAINSTABLE() or FREETEXTTABLE() when relevance ranking is required.
Consider hybrid search when applications require both keyword precision and semantic understanding.
Monitor full-text index population and maintenance in production environments.
DP-800 Exam Tips
Know the differences between CONTAINS(), FREETEXT(), CONTAINSTABLE(), and FREETEXTTABLE().
Understand how full-text indexes differ from traditional SQL indexes.
Remember that full-text search is keyword-based, while vector search is meaning-based.
Understand the purpose of stoplists, word breakers, stemmers, and thesaurus files.
Expect scenario-based questions asking you to choose between LIKE queries, full-text search, vector search, and hybrid search based on application requirements.
Know when full-text search is sufficient and when semantic search or hybrid search provides a better user experience.
Practice Exam Questions
Question 1
A company stores millions of technical articles in an Azure SQL Database. Users frequently search for exact product names and technical terms. Developers currently use the following query:
SELECT*
FROM Articles
WHERE Content LIKE'%Azure SQL%'
The search is becoming increasingly slow as the table grows.
Which feature should you recommend?
A. Full-text search B. Columnstore indexes C. Semantic vector search D. Table partitioning
Correct Answer:A
Explanation
Full-text search is specifically designed for efficient searching of large text columns. It creates specialized indexes that support keyword searches, phrase matching, ranking, and linguistic analysis. While table partitioning and columnstore indexes improve other workloads, they do not replace full-text search functionality.
Question 2
Which SQL Server function searches for exact words, phrases, Boolean expressions, and prefix terms?
A. FREETEXT() B. CONTAINS() C. PATINDEX() D. CHARINDEX()
FREETEXT() is intended for natural-language searching rather than precise keyword expressions.
Question 3
A developer wants search results to include different grammatical forms of the word run, such as:
running
runs
ran
Which SQL Server component provides this capability?
A. Stoplists
B. Full-text catalogs
C. Stemmers
D. Clustered indexes
Correct Answer:C
Explanation
Stemmers recognize different inflectional forms of words based on language-specific rules. This allows a search for “run” to also return documents containing “running,” “runs,” or “ran.”
Question 4
Which statement best describes a full-text catalog?
A. It stores database backups.
B. It replaces clustered indexes.
C. It is a logical container that organizes one or more full-text indexes.
D. It stores vector embeddings.
Correct Answer:C
Explanation
A full-text catalog is a logical container for full-text indexes. While SQL Server automatically manages catalogs in newer versions, understanding their role remains important for administration and exam scenarios.
Question 5
Which function is most appropriate when users enter natural-language search phrases rather than precise keywords?
A. CONTAINS()
B. LIKE
C. FREETEXT()
D. PATINDEX()
Correct Answer:C
Explanation
FREETEXT() performs natural-language searches by considering linguistic analysis, stemming, and synonyms. It is designed for less structured search input compared to CONTAINS().
Question 6
Which full-text search feature helps reduce index size by excluding commonly occurring words such as the, is, and and?
A. Word breakers
B. Stoplists
C. Stemmers
D. Ranking tables
Correct Answer:B
Explanation
Stoplists contain common words, known as stop words, that are ignored during indexing and searching. This improves both index efficiency and search relevance.
Question 7
Your application must display search results ordered from the most relevant document to the least relevant.
Which functions are specifically designed for this purpose?
A. CONTAINS() and FREETEXT()
B. LIKE and PATINDEX()
C. CONTAINSTABLE() and FREETEXTTABLE()
D. CHARINDEX() and STRING_SPLIT()
Correct Answer:C
Explanation
CONTAINSTABLE() and FREETEXTTABLE() return a RANK value that indicates the relevance of each result, allowing applications to sort documents by search quality.
Question 8
Which scenario is the best use case for traditional full-text search?
A. Finding semantically similar customer support tickets
B. Building a Retrieval-Augmented Generation (RAG) chatbot
C. Recommending similar research papers based on meaning
D. Searching legal documents using exact legal terminology
Correct Answer:D
Explanation
Full-text search excels when users search using precise words and phrases, making it well suited for legal, compliance, technical documentation, and product catalog scenarios. Semantic vector search is generally preferred for AI assistants and recommendation systems.
Question 9
Which component is responsible for separating text into searchable words based on language-specific rules?
A. Word breakers
B. Stoplists
C. Embedding models
D. Full-text catalogs
Correct Answer:A
Explanation
Word breakers tokenize text into individual searchable terms according to the linguistic rules of the configured language. Proper tokenization is essential for accurate indexing and querying.
Question 10
A company is building an AI-powered knowledge assistant. Users expect searches such as:
“recover my account”
to return documents titled:
“reset your password”
Which recommendation is most appropriate?
A. Continue using LIKE queries
B. Use only full-text search
C. Replace all searches with clustered indexes
D. Combine full-text search with semantic vector search using hybrid search
Correct Answer:D
Explanation
Full-text search primarily matches keywords and phrases, while semantic vector search retrieves documents based on meaning. Hybrid search combines both approaches, producing more accurate results for AI-powered applications such as RAG systems and enterprise knowledge assistants.
DP-800 Exam Tips
Use full-text search when exact keywords, phrases, and language-aware matching are required.
Understand the differences between CONTAINS(), FREETEXT(), CONTAINSTABLE(), and FREETEXTTABLE().
Remember that word breakers tokenize text, stemmers recognize grammatical variations, and stoplists remove common words to improve search efficiency.
Use ranking functions when applications need to order search results by relevance.
Recognize that LIKE queries are not appropriate for large-scale enterprise text search.
Know that full-text search is keyword-based, while vector search is meaning-based; hybrid search combines the strengths of both and is often the preferred approach for AI-enabled search solutions.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Design for vector data, including vector data type, vector indexes, and size
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
Modern AI-enabled applications increasingly rely on vector data to represent the meaning of text, images, audio, and other unstructured information. Instead of matching exact words, vector-based search enables applications to find content based on semantic similarity.
Microsoft SQL Server 2025, Azure SQL Database, and Azure SQL Managed Instance introduce native support for vector data, allowing databases to store embeddings directly alongside relational data. Combined with AI models and vector indexes, SQL databases become powerful platforms for semantic search, Retrieval-Augmented Generation (RAG), recommendation engines, document similarity, and AI assistants.
For the DP-800 exam, candidates should understand how to:
Design schemas that store vector embeddings
Choose appropriate vector dimensions
Understand vector data types
Create and maintain vector indexes
Balance storage, performance, and accuracy
Select index types appropriate for AI workloads
Understand how vector size affects database performance
What Is Vector Data?
A vector is a numerical representation of data generated by an embedding model.
Instead of storing text directly, the model converts text into hundreds or thousands of floating-point numbers.
Example:
Original text:
“Azure SQL supports AI-powered search.”
Embedding:
[0.012,
-0.553,
0.441,
...
0.318]
This numerical representation captures semantic meaning.
Documents discussing:
AI databases
Azure SQL
semantic search
will produce vectors located close together within vector space.
Why Store Vectors in SQL?
Traditionally, embeddings were stored in external vector databases.
Modern SQL databases now support vectors directly, allowing organizations to:
Keep structured and unstructured data together
Simplify architecture
Reduce synchronization complexity
Improve transactional consistency
Query relational and vector data simultaneously
Example table:
ProductID
Name
Category
Description
DescriptionEmbedding
101
Laptop
Electronics
Portable computer
Vector
This allows applications to perform:
SQL filtering
joins
semantic search
within one query.
Understanding the Vector Data Type
The new VECTOR data type stores embeddings efficiently inside SQL tables.
Example:
VECTOR(1536)
The number specifies the vector dimensions.
Examples:
VECTOR(768)
VECTOR(1024)
VECTOR(1536)
VECTOR(3072)
The dimension must exactly match the embedding model.
What Are Vector Dimensions?
Each embedding model outputs a fixed number of values.
Examples:
Model
Typical Dimensions
Small embedding model
768
text-embedding-3-small
1536
text-embedding-3-large
3072
If an embedding model generates 1536 values:
VECTOR(1536)
must be used.
Using the wrong size causes insert failures.
Choosing the Correct Vector Size
Higher dimensions provide richer semantic meaning.
However they also require:
more storage
larger indexes
slower searches
additional memory
Example comparison:
Dimensions
Characteristics
256
Very small, fast, lower accuracy
768
Good balance
1024
Higher quality
1536
Excellent semantic understanding
3072
Highest quality but larger storage
Choosing unnecessarily large vectors wastes storage.
How Embedding Size Affects Storage
Each dimension stores a floating-point number.
Example:
1536 dimensions
≈1536 floating point values
Across one million rows:
1,000,000 vectors
×
1536 dimensions
This becomes a significant storage requirement.
Large AI applications should estimate storage before deployment.
Designing Tables for Vector Data
Common design:
Documents
------------
DocumentID
Title
Category
Content
Embedding
The embedding column stores semantic meaning.
Other columns remain relational.
This design enables hybrid queries.
Separating Embeddings from Business Data
Many organizations separate embeddings into another table.
Example:
Documents
DocumentID
Title
Content
DocumentEmbeddings
DocumentID
Embedding
ModelVersion
CreatedDate
Benefits:
easier regeneration
reduced locking
independent maintenance
multiple embedding versions
Versioning Embeddings
Embedding models evolve.
Example:
Version 1:
text-embedding-3-small
Later:
text-embedding-3-large
A model change usually requires regenerating all vectors.
Many databases store:
Model Name
Version
Generation Date
This allows safe migrations.
One Embedding or Multiple?
Some applications store several embeddings.
Example:
Products
Title embedding
Description embedding
Review embedding
Different searches can target different meanings.
Designing for Chunk-Level Embeddings
Large documents are usually divided into chunks.
Instead of:
Entire PDF
↓
One vector
Applications store:
Document
↓
Paragraphs
↓
One vector per paragraph
Benefits include:
higher search precision
better RAG responses
smaller embeddings
improved relevance
Vector Search vs Traditional Search
Traditional search matches keywords.
Example:
Search:
vehicle
Document:
car
Keyword search may miss it.
Vector search recognizes semantic similarity.
It understands:
automobile
vehicle
car
SUV
are closely related.
Combining SQL Filters with Vector Search
One major benefit of SQL databases is combining structured filters with AI search.
Example:
Category = Electronics
AND
Vector similarity
Only electronics are searched semantically.
This improves both performance and relevance.
Exact Search vs Approximate Search
Vector searches generally use two approaches.
Exact Search
Compares every vector.
Advantages:
highest accuracy
Disadvantages:
slower
expensive for large datasets
Approximate Search
Uses specialized indexes.
Advantages:
much faster
scalable
Tradeoff:
slight reduction in accuracy
Most production AI systems use approximate search.
Understanding Vector Indexes
Without indexes:
Every vector must be compared.
1 million vectors
↓
1 million comparisons
Vector indexes dramatically reduce work.
They organize vectors based on similarity.
This enables very fast nearest-neighbor searches.
Approximate Nearest Neighbor (ANN)
Modern vector databases commonly use ANN indexing.
Instead of checking every vector:
Search
↓
Relevant region
↓
Nearby vectors
↓
Best matches
Response times become milliseconds instead of seconds.
Why Vector Indexes Matter
Benefits include:
faster semantic search
reduced CPU usage
scalable AI applications
improved RAG performance
lower query latency
Large AI systems depend heavily on vector indexing.
Choosing Whether to Create a Vector Index
Small datasets:
A vector index may not provide significant benefit.
Large datasets:
Vector indexes become essential.
Typical guidance:
Rows
Recommendation
Thousands
Optional
Hundreds of thousands
Recommended
Millions
Essential
Best Practices
Use the embedding dimensions required by the selected model.
Store vectors in dedicated VECTOR columns.
Keep relational data alongside embeddings whenever practical.
Separate embeddings into dedicated tables when frequent regeneration is expected.
Track embedding model versions.
Chunk large documents before generating embeddings.
Choose the smallest embedding model that delivers acceptable quality.
Create vector indexes for large datasets.
Combine relational filtering with semantic search.
Monitor storage growth as embeddings increase.
Common Exam Tips
Know that VECTOR stores embedding data.
Understand that vector dimensions must match the embedding model.
Remember that larger vectors increase storage and memory requirements.
Recognize that vector indexes accelerate semantic similarity searches.
Understand the difference between exact and approximate nearest-neighbor searches.
Know that chunking improves retrieval quality for large documents.
Understand that multiple embeddings may exist for a single record.
Remember that embedding model upgrades usually require regenerating vectors.
Understand that relational filtering and vector search can be combined.
Expect scenario-based questions involving storage, indexing, scalability, and AI search architecture.
Practice Exam Questions
Question 1
A company is building a Retrieval-Augmented Generation (RAG) application using Azure SQL Database. They plan to store embeddings generated by the text-embedding-3-small model.
Which VECTOR data type should be used for the embedding column?
Explanation: The text-embedding-3-small model generates 1,536-dimensional embeddings. The VECTOR column must match the number of dimensions produced by the embedding model. Using any other dimension would prevent embeddings from being stored correctly.
Question 2
A database contains 12 million product embeddings. Semantic searches are becoming increasingly slow because every query compares all vectors.
What should the database developer implement?
A. A clustered index on the VECTOR column B. A vector index that supports Approximate Nearest Neighbor (ANN) searches C. A nonclustered index on the product name D. A filtered index on the category column
Correct Answer: B
Explanation: Vector indexes using Approximate Nearest Neighbor algorithms dramatically reduce the number of comparisons required during similarity searches. Traditional SQL indexes cannot optimize vector similarity calculations.
Question 3
A developer must choose between a 768-dimensional embedding model and a 3,072-dimensional embedding model.
What is generally true about the larger embedding model?
A. It always performs searches faster. B. It requires fewer storage resources. C. It typically captures more semantic detail but requires additional storage and memory. D. It cannot be indexed.
Correct Answer: C
Explanation: Higher-dimensional embeddings generally preserve more semantic information, improving search quality. However, they increase storage requirements, memory consumption, and indexing costs.
Question 4
A database stores customer information together with vector embeddings representing customer support conversations.
Which design provides the greatest flexibility for regenerating embeddings after switching to a new embedding model?
A. Store embeddings in a separate table linked by the primary key. B. Store embeddings inside a JSON document. C. Store embeddings inside XML columns. D. Store embeddings inside temporary tables.
Correct Answer: A
Explanation: Separating embeddings into their own table simplifies regeneration, maintenance, versioning, and model migration while keeping business data unchanged.
Question 5
A development team wants to search only engineering documents while using semantic similarity.
Which approach best meets this requirement?
A. Perform only vector similarity searches across every document. B. Filter documents by department using SQL, then perform vector similarity searches. C. Disable relational filtering. D. Store engineering documents in a separate SQL Server instance.
Correct Answer: B
Explanation: One advantage of SQL databases is combining structured filtering with vector similarity search. Restricting the dataset before similarity comparisons improves both performance and relevance.
Question 6
A company stores embeddings for technical manuals that average 400 pages each.
What is the recommended design approach?
A. Generate one embedding for the entire manual. B. Store only the title as an embedding. C. Divide manuals into logical chunks and generate embeddings for each chunk. D. Generate embeddings only for images.
Correct Answer: C
Explanation: Chunking improves semantic retrieval accuracy by allowing searches to return only the most relevant portions of large documents rather than entire documents.
Question 7
A developer upgrades from one embedding model to another that produces vectors with a different number of dimensions.
What should the developer expect?
A. Existing vectors automatically resize. B. Existing vectors remain compatible without changes. C. SQL Server automatically converts vector dimensions. D. Existing embeddings must be regenerated to match the new model dimensions.
Correct Answer: D
Explanation: Embedding dimensions are fixed for each model. Changing models often changes vector size, requiring regeneration of all stored embeddings.
Question 8
An application contains approximately 3,000 embedded documents.
Which statement is most accurate regarding vector indexes?
A. Vector indexes are mandatory regardless of database size. B. Vector indexes cannot be created until at least one million vectors exist. C. A vector index may provide limited benefit for a very small dataset. D. Vector indexes only work with GraphQL.
Correct Answer: C
Explanation: Small datasets often perform adequately without vector indexes. The performance gains become much more significant as the number of vectors increases.
Question 9
A developer wants to support semantic search over product descriptions while maintaining product categories, prices, and inventory information in the same database.
Which database design best supports this objective?
A. Store embeddings in a VECTOR column while keeping relational attributes in standard SQL columns. B. Store all relational data inside embedding vectors. C. Replace relational tables with JSON files. D. Store embeddings only in application memory.
Correct Answer: A
Explanation: Keeping embeddings alongside relational data enables hybrid queries that combine SQL filtering with semantic similarity search, one of the major strengths of AI-enabled SQL databases.
Question 10
Which factor has the greatest impact on the storage requirements of vector data?
A. Database collation B. Number of database users C. Recovery model D. Number of dimensions in each embedding
Correct Answer: D
Explanation: Each embedding stores one numeric value per dimension. As the number of dimensions increases, the storage required for each vector grows proportionally, affecting table size, indexes, backups, and memory usage.
Final Exam Tips
Ensure the VECTOR column dimension exactly matches the embedding model.
Larger embeddings generally improve semantic quality but increase storage and computational costs.
Use vector indexes (ANN) for large datasets to improve search performance.
Combine relational SQL filtering with vector similarity searches for efficient hybrid queries.
Chunk large documents before generating embeddings to improve retrieval quality.
Store embedding model metadata and versions to simplify future migrations.
Separate embeddings from business data when frequent regeneration is expected.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Identify when to use vector-related types and functions for semantic searching, including VECTOR_NORMALIZE, VECTOR_DISTANCE, VECTORPROPERTY, and VECTOR_SEARCH
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
Modern AI-powered database applications increasingly rely on semantic search, which retrieves information based on meaning rather than exact keyword matches. SQL Server 2025 (Preview), Azure SQL Database, and Azure SQL Managed Instance now include native vector capabilities, allowing developers to store embeddings and perform semantic searches directly inside the database.
Instead of exporting data to a separate vector database, developers can use built-in vector data types and functions to compare embeddings, calculate similarity, inspect vector metadata, normalize vectors, and perform efficient nearest-neighbor searches.
For the DP-800 certification exam, you should understand:
When semantic search is appropriate
The purpose of the VECTOR data type
How VECTOR_DISTANCE measures similarity
Why VECTOR_NORMALIZE is useful
How VECTORPROPERTY retrieves vector metadata
When to use VECTOR_SEARCH
Performance considerations
Common semantic search design patterns
Understanding Semantic Search
Traditional SQL searches compare exact values.
Example:
WHERE Description LIKE'%car%'
This search only returns rows containing the word car.
Semantic search instead compares meaning.
Searching for:
vehicle
may also return:
automobile
SUV
truck
sedan
crossover
because their embeddings are close together within vector space.
Native Vector Support in SQL
Microsoft SQL now supports vectors as first-class database objects.
Instead of storing embeddings externally, SQL databases can store:
relational columns
vector columns
AI metadata
inside one table.
Example:
ProductID
Name
Category
Embedding
101
Laptop
Electronics
VECTOR(1536)
This enables SQL to perform both relational filtering and semantic similarity searches.
VECTOR Data Type
The VECTOR data type stores embedding values.
Example:
Embedding VECTOR(1536)
The dimension must exactly match the embedding model.
Examples:
VECTOR(768)
VECTOR(1024)
VECTOR(1536)
VECTOR(3072)
The VECTOR type is the foundation of all semantic search operations.
When to Use VECTOR_DISTANCE
VECTOR_DISTANCE measures how similar two vectors are.
Think of it as calculating the “distance” between meanings.
Smaller distance
↓
More similar
Larger distance
↓
Less similar
Example:
Customer query:
lightweight laptop
Document A
portable notebook computer
Very small distance
Document B
kitchen appliances
Very large distance
Common Uses of VECTOR_DISTANCE
Developers commonly use VECTOR_DISTANCE to:
Rank search results
Compare embeddings
Measure semantic similarity
Build recommendation engines
Find related documents
Identify duplicate content
Support AI assistants
Example Scenario
Suppose a user searches:
cloud database backup
SQL compares the query embedding against stored embeddings.
Each document receives a distance score.
Example:
Document
Distance
Azure Backup Guide
0.08
SQL Disaster Recovery
0.13
Cloud Storage Overview
0.19
Restaurant Menu
0.92
The smallest distance represents the best semantic match.
Choosing a Distance Metric
Several similarity calculations exist.
Common metrics include:
Cosine similarity
Euclidean distance
Dot product
SQL vector functions abstract much of this complexity.
Developers simply request semantic similarity without implementing complex mathematics.
Why VECTOR_NORMALIZE Exists
Different vectors may have different magnitudes.
Normalization converts vectors into standardized lengths.
Instead of comparing:
Length + Direction
only
Direction
is compared.
This improves consistency.
When to Normalize Vectors
Normalization is commonly used when:
comparing embeddings from different sources
improving cosine similarity calculations
preprocessing vectors
preparing vectors before indexing
Many embedding models already generate normalized vectors.
Others do not.
Benefits of VECTOR_NORMALIZE
Normalization helps:
improve comparison consistency
reduce magnitude bias
improve semantic similarity scoring
produce more reliable nearest-neighbor searches
VECTORPROPERTY
VECTORPROPERTY retrieves metadata about vectors.
Rather than comparing vectors, it provides information about them.
Examples include:
dimension count
storage characteristics
metadata
vector properties
Developers often use VECTORPROPERTY for:
validation
diagnostics
troubleshooting
quality checks
Example Scenario
A developer receives embeddings from multiple AI models.
Some generate:
768 dimensions
Others generate:
1536 dimensions
Before inserting data, the developer verifies dimensions using VECTORPROPERTY.
Instead of writing complex similarity calculations manually, developers can search vectors directly.
Typical workflow:
User Question
↓
Generate embedding
↓
VECTOR_SEARCH
↓
Most similar documents
↓
Return results
When to Use VECTOR_SEARCH
VECTOR_SEARCH is ideal for:
Retrieval-Augmented Generation (RAG)
AI chatbots
document search
recommendation engines
semantic search portals
customer support systems
knowledge bases
VECTOR_SEARCH vs VECTOR_DISTANCE
Although related, they serve different purposes.
VECTOR_DISTANCE
compares two vectors
VECTOR_SEARCH
searches an entire collection
Think of it this way:
VECTOR_DISTANCE
↓
Individual comparison
VECTOR_SEARCH
↓
Database-wide search
Example Workflow
A user asks:
How do I configure Azure SQL backups?
Step 1
Generate query embedding.
↓
Step 2
VECTOR_SEARCH finds similar documents.
↓
Step 3
Top documents returned.
↓
Step 4
LLM generates an answer.
Combining SQL Filtering with VECTOR_SEARCH
One advantage of SQL databases is hybrid querying.
Example:
Return only:
Category = Documentation
AND
perform semantic search.
This combines relational filtering with AI similarity.
Benefits include:
better accuracy
faster searches
improved relevance
Performance Considerations
Semantic search can become expensive.
Best practices include:
use vector indexes
normalize vectors when appropriate
filter relational data first
avoid unnecessarily large embeddings
use approximate nearest-neighbor indexes
limit returned results
Typical Semantic Search Architecture
Documents
↓
Generate embeddings
↓
Store vectors
↓
Create vector index
↓
User submits question
↓
Generate query embedding
↓
VECTOR_SEARCH
↓
Nearest neighbors
↓
LLM response
Choosing the Correct Function
Function
Primary Purpose
VECTOR
Stores embeddings
VECTOR_DISTANCE
Measures similarity between two vectors
VECTOR_NORMALIZE
Standardizes vectors before comparison
VECTORPROPERTY
Returns vector metadata
VECTOR_SEARCH
Searches collections for similar vectors
Best Practices
Store embeddings using the VECTOR data type.
Match VECTOR dimensions to the embedding model.
Use VECTOR_SEARCH for semantic retrieval.
Use VECTOR_DISTANCE for direct similarity comparisons.
Normalize vectors when required by the similarity metric.
Use VECTORPROPERTY to validate vector characteristics.
Combine relational filters with vector searches.
Create vector indexes for large datasets.
Store embedding model versions alongside vectors.
Monitor storage and indexing costs.
Common DP-800 Exam Tips
Understand when semantic search is preferable to keyword search.
Know the purpose of each vector function.
Understand that VECTOR_DISTANCE compares two vectors, while VECTOR_SEARCH searches an entire dataset.
Remember that VECTOR_NORMALIZE standardizes vectors before comparison.
Know that VECTORPROPERTY retrieves vector metadata rather than similarity scores.
Expect scenario-based questions requiring you to choose the correct vector function for a given task.
Understand how these functions support RAG, AI assistants, recommendation systems, and semantic search.
Practice Exam Questions
Question 1
A development team is building a Retrieval-Augmented Generation (RAG) application. They need to compare a user’s query embedding against thousands of stored document embeddings and return the most semantically similar documents.
Which SQL function is specifically designed for this purpose?
A. VECTOR_DISTANCE
B. VECTOR_SEARCH
C. VECTORPROPERTY
D. VECTOR_NORMALIZE
Correct Answer:B
Explanation:
VECTOR_SEARCH is designed to search an entire collection of stored vectors and return the nearest neighbors based on semantic similarity. VECTOR_DISTANCE compares only two vectors, VECTORPROPERTY returns metadata, and VECTOR_NORMALIZE standardizes vectors before comparison.
Question 2
An application receives embeddings from several AI models. Before storing them in SQL, developers want to verify that every embedding contains the expected number of dimensions.
Which function should they use?
A. VECTORPROPERTY
B. VECTOR_DISTANCE
C. VECTOR_SEARCH
D. VECTOR_NORMALIZE
Correct Answer:A
Explanation:
VECTORPROPERTY returns metadata about a vector, including characteristics such as its dimensions. This makes it ideal for validating vectors before they are stored.
Question 3
A developer needs to calculate how semantically similar two individual product descriptions are after generating embeddings for each.
Which function should be used?
A. VECTORPROPERTY
B. VECTOR_SEARCH
C. VECTOR_DISTANCE
D. VECTOR_NORMALIZE
Correct Answer:C
Explanation:
VECTOR_DISTANCE calculates the similarity or distance between two vectors. It is appropriate when directly comparing one embedding against another rather than searching an entire dataset.
Question 4
A machine learning engineer wants to eliminate differences caused by varying vector magnitudes before calculating cosine similarity.
Which function is most appropriate?
A. VECTORPROPERTY
B. VECTOR_SEARCH
C. VECTOR_DISTANCE
D. VECTOR_NORMALIZE
Correct Answer:D
Explanation:
VECTOR_NORMALIZE scales vectors to a consistent length while preserving their direction. This improves similarity calculations that rely on normalized vectors, particularly cosine similarity.
Question 5
A customer support chatbot first filters documentation to only include networking articles and then performs semantic retrieval over those documents.
What is the primary advantage of this approach?
A. It removes the need for embeddings.
B. It combines relational filtering with semantic search for improved relevance.
C. It converts keyword search into full-text search.
D. It prevents vector indexing.
Correct Answer:B
Explanation:
Filtering relational data before performing vector search reduces the search space and increases the relevance of returned results, improving both performance and accuracy.
Question 6
A SQL developer needs to rank five candidate documents according to how closely each one matches a user’s question.
Which function should be applied repeatedly against each candidate vector?
A. VECTOR_DISTANCE
B. VECTOR_SEARCH
C. VECTORPROPERTY
D. VECTOR_NORMALIZE
Correct Answer:A
Explanation:
VECTOR_DISTANCE computes similarity between two vectors. Developers can compare the query vector against multiple document vectors and rank the results by the smallest distance.
Question 7
Which scenario is the best use case for VECTOR_SEARCH?
A. Determining the number of dimensions stored within a vector
B. Standardizing vectors before storage
C. Finding the most similar documents across an entire knowledge base
D. Comparing only two vectors for similarity
Correct Answer:C
Explanation:
VECTOR_SEARCH is optimized for nearest-neighbor retrieval across an entire vector collection, making it ideal for semantic search applications such as RAG systems and AI assistants.
Question 8
An organization stores millions of embeddings inside Azure SQL Database.
Which action provides the greatest improvement in semantic search performance?
A. Increasing the embedding dimensions
B. Eliminating relational filtering
C. Replacing vectors with VARCHAR columns
D. Creating vector indexes
Correct Answer:D
Explanation:
Vector indexes significantly improve nearest-neighbor search performance over large datasets. Without indexing, vector searches become increasingly expensive as data volumes grow.
Question 9
A developer mistakenly uses VECTOR_SEARCH when they simply need to compare two embeddings generated during a unit test.
Which function would have been the more appropriate choice?
A. VECTORPROPERTY
B. VECTOR_DISTANCE
C. VECTOR_NORMALIZE
D. VECTOR_SEARCH
Correct Answer:B
Explanation:
VECTOR_DISTANCE compares two vectors directly. VECTOR_SEARCH is intended for searching an entire vector collection and would introduce unnecessary overhead for a simple comparison.
Question 10
Which statement best describes VECTORPROPERTY?
A. It calculates semantic similarity between vectors.
B. It searches vector indexes for nearest neighbors.
C. It retrieves metadata about stored vectors.
D. It converts text into embeddings.
Correct Answer:C
Explanation:
VECTORPROPERTY returns information about vectors, such as their dimensions or other characteristics. It does not calculate similarity, generate embeddings, or perform semantic searches.
DP-800 Exam Tips
Know the distinction between VECTOR_DISTANCE (two-vector comparison) and VECTOR_SEARCH (collection-wide nearest-neighbor search).
Use VECTORPROPERTY to inspect or validate vector metadata before processing.
Apply VECTOR_NORMALIZE when your similarity metric or embedding workflow benefits from normalized vectors.
Combine relational filtering with semantic search to improve performance and relevance.
Create vector indexes for large datasets to optimize semantic search operations.
Expect scenario-based exam questions that require selecting the appropriate vector function based on a real-world AI application, such as RAG, semantic search, recommendation systems, or AI chatbots.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Choose between using ANN and ENN for vector search
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
Vector search is the foundation of modern AI-powered applications such as Retrieval-Augmented Generation (RAG), semantic search, recommendation engines, document similarity, and intelligent assistants. As vector databases grow from thousands to millions of embeddings, selecting the appropriate search algorithm becomes increasingly important.
One of the most important architectural decisions is choosing between:
Approximate Nearest Neighbor (ANN) search
Exact Nearest Neighbor (ENN) search
Although both methods retrieve vectors that are similar to a query vector, they differ significantly in performance, scalability, accuracy, resource usage, and appropriate use cases.
For the DP-800 exam, candidates should understand when to use ANN versus ENN, how vector indexes influence each approach, and the trade-offs involved in balancing search speed with search accuracy.
Understanding Nearest Neighbor Search
Once embeddings have been generated for documents, products, images, or other data, a user query is also converted into an embedding.
The search engine must identify the vectors that are “closest” to the query vector.
Closeness is typically measured using:
Cosine similarity
Euclidean distance (L2)
Dot product
The challenge becomes finding the nearest vectors efficiently.
If a database contains:
5,000 vectors
500,000 vectors
50 million vectors
the search strategy dramatically affects response time.
Exact Nearest Neighbor (ENN)
Exact Nearest Neighbor performs an exhaustive comparison.
Every stored vector is compared against the query vector.
The system computes the distance to every record before returning the closest matches.
Characteristics
Searches every vector
Produces mathematically exact results
No approximation
Highest accuracy
Computationally expensive
Slower as data grows
ENN Workflow
Query Vector
↓
Compare against Vector 1
↓
Compare against Vector 2
↓
Compare against Vector 3
↓
...
↓
Compare against Vector N
↓
Sort by similarity
↓
Return Top K
Advantages of ENN
Maximum Accuracy
Every possible vector is evaluated.
No relevant documents are skipped.
Deterministic Results
The same query always produces the same ranking.
No Index Approximation
Results represent the actual nearest neighbors.
Simpler Conceptually
The algorithm is straightforward.
No graph traversal or approximation heuristics are involved.
Disadvantages of ENN
Poor Scalability
Performance decreases linearly with dataset size.
Examples:
1,000 vectors → very fast
100,000 vectors → acceptable
10 million vectors → slow
100 million vectors → often impractical
High CPU Usage
Every query compares against every stored embedding.
Higher Latency
Search time increases as the vector collection grows.
Common ENN Use Cases
ENN is appropriate when:
Maximum precision is required
Dataset is relatively small
Scientific applications require exact matches
Benchmarking ANN algorithms
Testing search quality
Evaluation environments
Examples include:
Medical research
Financial analytics
Legal document comparison
Academic datasets
Quality assurance testing
Approximate Nearest Neighbor (ANN)
Approximate Nearest Neighbor avoids comparing every vector.
Instead, it uses specialized vector indexes that intelligently narrow the search space.
The goal is to find vectors that are almost certainly among the nearest neighbors while dramatically improving search speed.
ANN typically achieves:
95–99.9% recall
Much lower latency
Massive scalability
ANN Workflow
Query Vector
↓
Search Vector Index
↓
Explore Nearby Candidates
↓
Evaluate Candidate Vectors
↓
Return Top K
Instead of examining millions of vectors, ANN may evaluate only a few hundred or a few thousand candidate vectors.
Advantages of ANN
Extremely Fast
ANN dramatically reduces search time.
Milliseconds instead of seconds.
Highly Scalable
Suitable for:
Millions of vectors
Tens of millions
Hundreds of millions
Billions of vectors
Lower Compute Costs
Fewer distance calculations are required.
Excellent User Experience
Ideal for interactive AI applications requiring real-time responses.
Production Ready
Nearly every modern AI search engine uses ANN.
Examples include:
Azure AI Search
Azure SQL vector indexes
Azure Cosmos DB vector search
Pinecone
Milvus
Weaviate
Qdrant
FAISS
pgvector with ANN indexes
Disadvantages of ANN
Results Are Approximate
Occasionally, the true nearest neighbor may not be returned.
Instead, the algorithm returns vectors that are extremely close.
Slight Reduction in Recall
Typical recall values:
95%
98%
99%
depending on index configuration.
Index Maintenance
ANN requires building and maintaining vector indexes.
Additional Memory Usage
Indexes consume additional storage.
ANN vs ENN Comparison
Feature
ENN
ANN
Accuracy
100%
Nearly 100%
Speed
Slower
Much faster
Scalability
Poor
Excellent
Uses Vector Index
No
Yes
CPU Usage
High
Lower
Memory Usage
Lower
Higher
Best for Small Data
Yes
Sometimes
Best for Large Data
No
Yes
Typical Production Choice
Rare
Very Common
Why ANN Is Usually Preferred
Most enterprise AI applications prioritize:
Fast responses
Interactive user experiences
Large knowledge bases
Millions of documents
Waiting several seconds for every search is unacceptable.
Therefore, ANN has become the industry standard for production semantic search.
For example:
A chatbot searching:
8 million support articles
cannot realistically compare every embedding.
Instead, ANN rapidly narrows the candidate set before computing exact similarity among only the most promising vectors.
Recall vs Accuracy
One of the most important concepts is recall.
Recall measures how many of the true nearest neighbors are successfully returned.
Example:
Suppose the true Top 10 neighbors are:
A
B
C
D
E
F
G
H
I
J
An ANN search returns:
A
B
C
D
E
F
G
H
I
K
Recall is:
9 / 10 = 90%
Although one neighbor is missing, the results are still highly useful for most AI applications.
Many ANN algorithms achieve recall rates above 99%.
Popular ANN Algorithms
Several indexing algorithms support ANN search.
Common examples include:
HNSW (Hierarchical Navigable Small World)
Most common modern ANN algorithm.
Advantages:
Very fast
Excellent recall
High-quality results
Widely used
IVF (Inverted File Index)
Partitions vectors into clusters.
Search examines only relevant clusters.
Good for extremely large datasets.
DiskANN
Optimized for very large vector collections stored partly on disk.
Designed for cloud-scale systems.
Product Quantization (PQ)
Compresses vectors to reduce memory usage.
Often combined with IVF.
Choosing Between ANN and ENN
Choose ENN When
Dataset is small
Exact results are mandatory
Benchmarking search quality
Scientific analysis
Compliance requires deterministic behavior
Testing vector models
Choose ANN When
Dataset contains millions of vectors
Response time matters
Building chatbots
Implementing RAG
Semantic document search
Recommendation systems
AI copilots
Enterprise knowledge bases
ANN in Azure SQL
Azure SQL’s vector search capabilities are designed to support scalable semantic search workloads.
When vector indexes are implemented, Azure SQL can perform ANN searches efficiently, making it practical to query very large embedding collections while maintaining excellent recall.
This enables AI-powered applications to combine:
Relational filtering
Vector similarity
SQL queries
AI inference
within a single database platform.
ANN and Hybrid Search
Many production applications combine ANN with traditional filtering.
Example:
A company stores:
20 million product embeddings
A customer searches:
“Wireless ergonomic keyboard”
The query first filters:
Category = Electronics
Brand = Microsoft
Price < $150
Then ANN searches only the filtered candidate vectors.
This combination improves:
Speed
Relevance
Scalability
DP-800 Exam Tips
Understand that ENN performs exhaustive comparisons, while ANN uses vector indexes to accelerate nearest-neighbor retrieval.
Remember that ANN trades a small amount of accuracy for significant gains in performance and scalability, making it the preferred option for production AI systems.
Be familiar with HNSW, IVF, and other ANN indexing techniques at a conceptual level.
Know that ENN is appropriate for small datasets, benchmarking, and scenarios requiring mathematically exact results.
Expect scenario-based questions asking which approach is best based on dataset size, latency requirements, scalability, and accuracy expectations.
Recognize that ANN is the default choice for RAG systems, semantic search, recommendation engines, AI assistants, and enterprise knowledge bases containing millions of embeddings.
Practice Exam Questions
Question 1
A company has built a Retrieval-Augmented Generation (RAG) solution that searches through 50 million document embeddings. Users expect responses within two seconds. Which vector search approach is the most appropriate?
A. Exact Nearest Neighbor (ENN) because it guarantees mathematically exact results for every query
B. Approximate Nearest Neighbor (ANN) because it provides low-latency searches while maintaining high recall
C. Sequential table scans because they avoid maintaining vector indexes
D. Full-text search because embeddings are not required for semantic search
Correct Answer:B
Explanation: ANN is specifically designed for large-scale vector datasets where fast response times are essential. It dramatically reduces search latency while maintaining very high recall, making it ideal for production RAG systems.
Question 2
A research laboratory is validating a new embedding model and requires every query to return the mathematically closest vectors with no approximation. Which search method should be used?
A. Hybrid search
B. Hierarchical Navigable Small World (HNSW)
C. Exact Nearest Neighbor (ENN)
D. Approximate Nearest Neighbor (ANN)
Correct Answer:C
Explanation: ENN compares the query vector against every stored vector, guaranteeing exact nearest-neighbor results. This makes it appropriate for benchmarking, scientific validation, and testing.
Question 3
What is the primary advantage of Approximate Nearest Neighbor (ANN) search over Exact Nearest Neighbor (ENN) search?
A. ANN always returns more accurate results.
B. ANN eliminates the need for vector embeddings.
C. ANN significantly improves search performance and scalability by reducing the number of vectors evaluated.
D. ANN only works with relational databases.
Correct Answer:C
Explanation: ANN achieves much faster searches by using specialized vector indexes to evaluate only the most promising candidate vectors instead of comparing every vector.
Question 4
A database contains approximately 2,500 embeddings used by a legal review application where accuracy is more important than response time. Which search strategy is most appropriate?
A. Approximate Nearest Neighbor (ANN)
B. Hybrid search
C. Semantic ranking
D. Exact Nearest Neighbor (ENN)
Correct Answer:D
Explanation: With a relatively small dataset and strict accuracy requirements, ENN is preferred because it guarantees exact nearest-neighbor results.
Question 5
Which statement best describes the concept of recall in Approximate Nearest Neighbor search?
A. It measures how quickly a query completes.
B. It measures the percentage of true nearest neighbors successfully returned.
C. It measures the amount of memory consumed by the vector index.
D. It measures the total number of vectors stored.
Correct Answer:B
Explanation: Recall measures how many of the actual nearest neighbors are retrieved by the ANN algorithm. Higher recall indicates results that more closely match those of an exact search.
Question 6
Which indexing algorithm is most commonly associated with modern ANN implementations due to its excellent balance of speed and recall?
A. HNSW (Hierarchical Navigable Small World)
B. B-tree
C. Hash index
D. Clustered columnstore index
Correct Answer:A
Explanation: HNSW is one of the most widely used ANN algorithms because it provides fast searches with excellent recall for large vector datasets.
Question 7
A development team notices that vector search performance decreases as the database grows from thousands to tens of millions of embeddings. Which architectural change is most likely to improve scalability?
A. Replace vector embeddings with keyword indexes.
B. Use ENN for every query.
C. Disable vector indexes.
D. Implement ANN with an appropriate vector index.
Correct Answer:D
Explanation: ANN combined with vector indexes is specifically designed to scale efficiently to millions or even billions of embeddings while maintaining acceptable accuracy.
Question 8
Which characteristic is typically associated with Exact Nearest Neighbor (ENN) search?
A. Uses approximation techniques to improve performance.
B. Compares only a subset of candidate vectors.
C. Performs exhaustive comparisons against every stored vector.
D. Requires HNSW indexing.
Correct Answer:C
Explanation: ENN performs a complete comparison against all stored vectors, ensuring mathematically exact results but requiring significantly more computation.
Question 9
An AI-powered product recommendation system serves millions of users each day. The recommendation engine must respond in milliseconds while maintaining highly relevant results. Which approach best meets these requirements?
A. Exact Nearest Neighbor (ENN)
B. Sequential vector scans
C. ANN using vector indexes
D. Full-table scans followed by sorting
Correct Answer:C
Explanation: ANN is optimized for production AI workloads that require low latency and high scalability while maintaining high-quality semantic search results.
Question 10
Which statement best summarizes the trade-off between ANN and ENN?
A. ENN sacrifices accuracy for better scalability.
B. ANN always returns identical results to ENN.
C. ENN requires vector indexes while ANN does not.
D. ANN slightly reduces accuracy in exchange for dramatically improved search performance and scalability.
Correct Answer:D
Explanation: The primary trade-off is that ANN accepts a small reduction in accuracy (typically maintaining 95–99%+ recall) to achieve significantly faster query performance and support very large datasets.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Evaluate vector index types and metrics
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
Understanding vector indexes and similarity metrics is essential when building AI-enabled database applications that perform semantic search, retrieval-augmented generation (RAG), recommendation engines, and AI-powered document retrieval. Selecting the correct vector index type and similarity metric has a major impact on search accuracy, scalability, latency, and infrastructure costs.
Traditional database indexes are designed to efficiently locate exact values or values within a range.
Examples include:
Primary key indexes
Clustered indexes
Nonclustered indexes
Full-text indexes
These indexes perform extremely well for queries such as:
WHERE CustomerID =123
or
WHERE LastName LIKE'Smith%'
However, AI applications frequently need to answer questions based on meaning rather than exact text.
For example:
User query:
“Hotels close to the beach with great seafood.”
Documents may contain:
“Oceanfront resort featuring fresh local cuisine.”
There are no matching keywords, yet both sentences describe the same concept.
This is where vector search becomes essential.
What Is a Vector?
A vector is a numerical representation of text, images, audio, or other data generated by an embedding model.
Instead of storing text as characters, AI models convert information into hundreds or thousands of numeric dimensions.
Example:
"The cat sat on the mat."
↓
[0.183,
-0.442,
0.913,
...
1536 dimensions]
Documents discussing similar concepts produce vectors that are mathematically close together.
Why Vector Indexes Are Needed
Suppose a database contains 10 million document embeddings.
Without an index:
every query compares against every vector
search complexity becomes enormous
latency may reach several seconds
Vector indexes organize vectors to reduce the number of comparisons dramatically while preserving high search quality.
Exact vs Approximate Search
Vector search generally falls into two categories.
Exact Search
Also known as:
Brute-force search
Exhaustive search
Process:
Compare query vector to every stored vector.
Calculate similarity score.
Sort results.
Return best matches.
Advantages:
100% accurate
Always finds nearest neighbor
Simple implementation
Disadvantages:
Slow
Poor scalability
High CPU usage
Best for:
Small datasets
Testing
Benchmarking
Approximate Nearest Neighbor (ANN)
ANN algorithms search intelligently instead of comparing every vector.
Advantages:
Extremely fast
Scales to millions or billions of vectors
Lower resource consumption
Tradeoff:
Results are extremely close to optimal but not always mathematically perfect.
Most enterprise AI systems use ANN indexes.
Common Vector Index Types
1. Flat Index (Brute Force)
Every vector is scanned.
Query
↓
Compare with Vector 1
↓
Compare with Vector 2
↓
Compare with Vector 3
↓
...
↓
Best Match
Advantages
Perfect accuracy
No preprocessing
Easy to maintain
Disadvantages
Slow
Doesn’t scale well
Best for
Small datasets
Testing
2. HNSW (Hierarchical Navigable Small World)
One of the most popular ANN indexes.
Rather than checking every vector, HNSW creates multiple graph layers.
High-level layers:
A
↓
B
↓
C
Lower layers:
A — D — E — F
\ |
G — H
The search begins at higher levels and progressively narrows the search.
Advantages
Extremely high recall
Very low latency
Excellent scalability
Disadvantages
More memory required
Longer index creation time
Commonly used in:
Azure SQL vector search
AI search engines
Modern vector databases
3. IVF (Inverted File Index)
Vectors are grouped into clusters.
Cluster A
Cluster B
Cluster C
Cluster D
Instead of searching every cluster:
Identify closest cluster.
Search only that cluster.
Advantages
Very fast
Efficient memory usage
Disadvantages
Search quality depends on clustering accuracy.
4. Product Quantization (PQ)
PQ compresses vectors into compact representations.
Instead of storing:
1536 floating-point numbers
it stores compressed codes.
Advantages
Huge storage savings
Faster searches
Lower memory usage
Disadvantages
Slight loss of precision
Often combined with IVF.
5. Disk-Based Indexes
Some systems keep indexes primarily on disk instead of RAM.
Advantages
Supports enormous datasets
Disadvantages
Higher latency
Useful when memory is limited.
Comparing Index Types
Index
Accuracy
Speed
Memory
Typical Use
Flat
Highest
Slow
Medium
Small datasets
HNSW
Very High
Very Fast
High
Enterprise RAG
IVF
High
Fast
Medium
Large datasets
IVF + PQ
Moderate-High
Very Fast
Low
Massive collections
Disk-based
High
Moderate
Low RAM
Very large databases
Understanding Similarity Metrics
A vector index determines how vectors are organized.
A similarity metric determines how closeness is measured.
Choosing the wrong metric can significantly reduce search quality.
Cosine Similarity
The most widely used similarity metric.
Measures the angle between vectors.
Formula (conceptually):
Similarity = cos(angle)
Identical direction:
1.0
Perpendicular:
0
Opposite direction:
-1
Advantages
Ignores vector magnitude
Excellent for semantic search
Very common in embedding models
Typical uses
Document search
Chatbots
RAG
Azure OpenAI embeddings
Euclidean Distance
Measures straight-line distance.
Distance = √((x₂−x₁)²...)
Smaller distance means greater similarity.
Advantages
Easy to understand
Works well for spatial data
Disadvantages
Sensitive to vector magnitude
Dot Product
Calculates the mathematical product of vectors.
Useful when embedding magnitude carries meaning.
Often used by recommendation systems.
Advantages
Computationally efficient
Good with normalized embeddings
Manhattan Distance
Also called:
L1 distance
Measures movement along axes.
|x1-x2| + |y1-y2|
Less common in vector databases.
Hamming Distance
Used for binary vectors.
Measures the number of differing bits.
Common in binary embeddings.
Choosing the Right Similarity Metric
Metric
Best For
Cosine Similarity
Semantic search
Euclidean Distance
Spatial similarity
Dot Product
Recommendation systems
Manhattan Distance
Grid-based comparisons
Hamming Distance
Binary vectors
Matching Metrics to Embedding Models
Many embedding models are trained assuming a particular similarity metric.
Cosine similarity is the preferred metric for most semantic search scenarios.
Choosing the appropriate similarity metric is just as important as choosing the index type.
Retrieval quality depends on embeddings, similarity metrics, and index configuration working together.
Practice Exam Questions
Question 1
A development team is building a Retrieval-Augmented Generation (RAG) solution containing over 15 million document embeddings. The application requires low query latency while maintaining high retrieval accuracy.
Which vector index type is the most appropriate?
A. Flat index
B. HNSW
C. Clustered index
D. Full-text index
Answer: B
Explanation: HNSW is designed for Approximate Nearest Neighbor (ANN) search and offers excellent recall with very low latency, making it a common choice for large-scale RAG implementations. Flat indexes become too slow at this scale, while clustered and full-text indexes are not vector indexes.
Question 2
Which similarity metric is most commonly used with modern text embedding models for semantic search?
A. Manhattan Distance
B. Euclidean Distance
C. Cosine Similarity
D. Hamming Distance
Answer: C
Explanation: Cosine similarity compares the angle between vectors rather than their magnitude, making it ideal for semantic search. Many embedding models, including Azure OpenAI embeddings, are designed to work effectively with cosine similarity.
Question 3
A database developer wants mathematically perfect nearest-neighbor results regardless of execution time.
Which search method should be selected?
A. Approximate Nearest Neighbor
B. Product Quantization
C. Exhaustive (Flat) Search
D. IVF
Answer: C
Explanation: Exhaustive or flat search compares the query against every stored vector, guaranteeing the exact nearest neighbors. This approach is computationally expensive but provides maximum accuracy.
Question 4
What is the primary purpose of Product Quantization (PQ)?
A. Improve SQL joins
B. Increase transaction throughput
C. Normalize embeddings
D. Reduce storage and memory requirements
Answer: D
Explanation: Product Quantization compresses vectors into compact representations, reducing storage and memory usage while enabling efficient searches. The tradeoff is a small reduction in precision.
Question 5
Which statement best describes Approximate Nearest Neighbor (ANN) indexing?
A. It guarantees perfect search accuracy.
B. It searches every vector sequentially.
C. It balances retrieval accuracy with search performance.
D. It only supports binary vectors.
Answer: C
Explanation: ANN algorithms reduce search time by avoiding exhaustive comparisons. They provide high-quality results with much better performance than exact search, making them suitable for production AI systems.
Question 6
A team notices that their semantic search results have degraded after switching from cosine similarity to Euclidean distance while using the same embedding model.
What is the most likely cause?
A. The embedding model was trained assuming cosine similarity.
B. Euclidean distance always produces identical results.
C. Vector indexes require clustered tables.
D. SQL Server does not support vectors.
Answer: A
Explanation: Embedding models are often optimized for specific similarity metrics. Using a different metric than the one assumed during training can reduce retrieval quality even if the vectors themselves remain unchanged.
Question 7
Why do vector indexes improve search performance?
A. They reduce the dimensionality of every embedding.
B. They organize vectors so fewer comparisons are needed.
C. They convert vectors into relational tables.
D. They eliminate the need for embeddings.
Answer: B
Explanation: Vector indexes structure embeddings so that searches examine only promising candidates instead of every stored vector, significantly reducing query latency.
Question 8
A company has a small proof-of-concept application containing 25,000 document embeddings. Search accuracy is more important than performance.
Which index is the best choice?
A. IVF + PQ
B. HNSW
C. Flat index
D. Disk-based ANN index
Answer: C
Explanation: For relatively small datasets where absolute accuracy is the priority, a flat index is often the simplest and most accurate solution. Performance remains acceptable because the collection size is limited.
Question 9
Which evaluation metric indicates how many true nearest neighbors are successfully returned during a vector search?
A. Latency
B. Precision
C. Throughput
D. Recall
Answer: D
Explanation: Recall measures the proportion of actual nearest neighbors that are retrieved by the search algorithm. Higher recall generally leads to better retrieval quality in semantic search and RAG systems.
Question 10
When evaluating different vector index types for a production AI solution, which combination of factors is most important?
A. File size and backup frequency
B. Number of SQL tables and views
C. Search latency, recall, memory usage, and index maintenance
D. Number of stored procedures and triggers
Answer: C
Explanation: Production vector indexes should be evaluated based on their ability to deliver fast queries, high recall, efficient memory utilization, and manageable maintenance as data volumes grow. These characteristics directly affect the performance and scalability of AI-enabled database solutions.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Implement vector search
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
Implementing vector search is one of the foundational skills for building modern AI-enabled database applications. Vector search enables databases to retrieve information based on semantic meaning rather than exact keyword matches, making it essential for Retrieval-Augmented Generation (RAG), AI assistants, recommendation engines, semantic document search, knowledge management systems, and intelligent enterprise applications.
What Is Vector Search?
Traditional SQL queries search for exact values.
For example:
SELECT*
FROM Products
WHERE ProductName ='Laptop';
or
WHERE Description LIKE'%wireless%'
These approaches rely on exact text matching.
However, AI applications often need to answer questions like:
“Find documents about reducing cloud costs.”
Relevant documents might contain:
Lower Azure spending
Optimize infrastructure expenses
Cloud cost optimization
Reduce operational costs
Although these documents contain different words, they share the same meaning.
Vector search enables databases to find these semantically related documents.
How Vector Search Works
Vector search consists of several stages.
User Query
↓
Embedding Model
↓
Query Vector
↓
Vector Similarity Search
↓
Nearest Neighbor Documents
↓
(Optional)
Large Language Model (LLM)
Instead of comparing text directly, the database compares numeric vector representations generated by an embedding model.
What Is a Vector?
A vector is a high-dimensional numerical representation of data.
Example:
"Azure SQL Database"
↓
[-0.134,
0.281,
0.998,
...
1536 dimensions]
Every document stored in the database has its own embedding vector.
When a user submits a query, the query is also converted into a vector.
The database then compares vectors mathematically to identify the most similar results.
Components of a Vector Search Solution
A complete vector search implementation includes several components.
1. Source Data
Examples include:
PDF files
Product catalogs
Emails
Knowledge articles
Web pages
Support tickets
SQL records
2. Embedding Model
The embedding model converts text into vectors.
Popular examples include:
Azure OpenAI Embeddings
OpenAI text embedding models
Sentence Transformers
Other compatible embedding models
The embedding model should remain consistent for both indexing and querying.
3. Vector Storage
Embeddings are stored inside the database.
Example table:
DocumentID
Content
Embedding
101
Product Manual
[1536 values]
102
FAQ
[1536 values]
103
Warranty Guide
[1536 values]
Modern SQL databases increasingly support dedicated vector data types.
4. Vector Index
Searching millions of vectors without an index would require comparing every vector.
Vector indexes organize embeddings for efficient similarity searches.
Common vector indexes include:
Flat (Exact Search)
HNSW
IVF
IVF + Product Quantization (PQ)
Approximate Nearest Neighbor (ANN) indexes are commonly used in production systems because they significantly reduce search latency while maintaining high recall.
5. Similarity Function
The database determines which vectors are closest.
Common similarity metrics include:
Cosine similarity
Euclidean distance
Dot product
Cosine similarity is the most common metric for semantic search.
Exact Search vs Approximate Search
Exact (Brute Force) Search
The database compares the query vector against every stored vector.
Advantages:
Perfect accuracy
Guaranteed nearest neighbors
Disadvantages:
Slow
Poor scalability
Best suited for:
Small datasets
Testing
Validation
Approximate Nearest Neighbor (ANN)
ANN indexes intelligently reduce the search space.
Advantages:
Extremely fast
Scales to millions or billions of vectors
Lower CPU utilization
Tradeoff:
Results are highly accurate but not mathematically perfect.
Most enterprise AI applications use ANN search.
Implementing Vector Search
A typical implementation follows these steps.
Step 1. Prepare Data
Collect the documents.
Examples:
Product manuals
Policies
Emails
Support articles
Clean the text by removing unnecessary formatting and duplicate content.
Step 2. Generate Embeddings
Use an embedding model to create vectors.
Example workflow:
Document
↓
Embedding Model
↓
1536-Dimensional Vector
Each document receives one or more embeddings.
Step 3. Store Embeddings
Store:
Original text
Metadata
Embedding vector
Example:
DocumentID
Category
Content
Embedding
501
HR
Vacation Policy
Vector
502
IT
VPN Setup
Vector
Metadata enables additional filtering during searches.
Step 4. Create a Vector Index
The vector index accelerates similarity searches.
Without an index:
Query
↓
Compare to every vector
With an ANN index:
Query
↓
Index
↓
Small candidate set
↓
Best matches
Step 5. Convert User Query
The user’s search query is embedded using the same embedding model.
Example:
"How do I connect remotely?"
↓
Embedding Model
↓
Query Vector
Consistency is critical. Using a different embedding model for queries than for indexed documents can significantly reduce search quality.
Step 6. Perform Similarity Search
The database compares the query vector with stored vectors.
Example SQL pseudocode:
SELECT TOP 5
DocumentID,
SimilarityScore
FROM Documents
ORDERBY VECTOR_DISTANCE(Embedding, @QueryVector);
The exact syntax varies depending on the database platform and vector search implementation.
Step 7. Return Results
The application retrieves the closest documents.
Example:
Rank
Document
1
VPN Configuration Guide
2
Remote Access FAQ
3
Employee Network Policy
Vector Search Workflow
Documents
↓
Generate Embeddings
↓
Store Vectors
↓
Create Vector Index
↓
User Query
↓
Generate Query Embedding
↓
Similarity Search
↓
Top Matching Documents
Filtering Vector Search Results
Many applications combine vector search with traditional SQL filtering.
Example:
Semantic Search
+
WHERE Department = 'Finance'
+
ORDER BY Similarity
This approach is often called hybrid filtering, allowing organizations to limit searches by structured metadata while still leveraging semantic similarity.
Examples of filters include:
Department
Date
Customer
Region
Security classification
Language
Hybrid Search
Hybrid search combines:
Keyword search
Full-text search
Vector search
Example:
Keyword Search
+
Vector Search
↓
Combined Ranking
↓
Final Results
Benefits include:
Higher relevance
Better handling of synonyms
Stronger ranking
Improved user satisfaction
Many enterprise AI search systems use hybrid search instead of vector search alone.
Using Vector Search in RAG
Retrieval-Augmented Generation relies heavily on vector search.
Workflow:
User Question
↓
Embedding
↓
Vector Search
↓
Relevant Documents
↓
LLM
↓
Grounded Response
Instead of relying solely on the LLM’s training data, the model uses retrieved documents as grounding data.
Benefits:
More accurate responses
Reduced hallucinations
Access to current organizational knowledge
Common Vector Search Scenarios
Enterprise Knowledge Search
Users ask natural language questions.
Example:
“How do I reset my VPN password?”
The database retrieves the most semantically relevant documentation.
Customer Support
Support engineers search:
“Printer won’t connect.”
Relevant troubleshooting documents are retrieved even if they use different wording.
Product Recommendation
Customers searching for:
“Comfortable running shoes”
may receive products described as:
Lightweight trainers
Cushioned athletic footwear
Marathon shoes
Legal Document Search
Law firms search by legal concepts rather than exact wording.
Healthcare Knowledge Bases
Clinicians retrieve similar cases based on symptoms rather than identical terminology.
Performance Considerations
Database developers should evaluate:
Search Latency
Users expect responses within milliseconds.
ANN indexes dramatically reduce latency.
Recall
Recall measures how many of the true nearest neighbors are returned.
Higher recall generally improves RAG quality.
Index Size
Larger indexes often improve retrieval quality but require more memory.
Memory Consumption
HNSW indexes typically consume more RAM than compressed indexes.
Index Build Time
Large vector indexes may require significant time to build.
Plan for maintenance windows when rebuilding indexes.
Update Frequency
Applications with frequent inserts and deletes should use index types that efficiently support incremental updates.
Common Implementation Mistakes
Using Different Embedding Models
Documents embedded with one model should not be searched using vectors generated by a different model.
Using the Wrong Similarity Metric
Many embedding models assume cosine similarity.
Using Euclidean distance or dot product incorrectly may reduce search accuracy.
Not Creating a Vector Index
Searching without an index performs poorly on large datasets.
Ignoring Metadata
Metadata filtering significantly improves result quality.
Returning Too Many Documents
Retrieving excessive documents increases latency and may overwhelm downstream LLMs in RAG systems.
Best Practices
Use the same embedding model for indexing and querying.
Choose a similarity metric recommended for the embedding model.
Use ANN indexes for production environments.
Combine vector search with metadata filters when appropriate.
Consider hybrid search for the highest-quality results.
Benchmark recall, latency, and throughput using realistic workloads.
Monitor index growth and rebuild or optimize indexes when necessary.
Store both embeddings and the original source content.
DP-800 Exam Tips
Remember these key points for the exam:
Vector search retrieves data based on semantic similarity rather than exact text.
Embeddings are numerical representations generated by AI models.
The same embedding model should be used for both indexing and querying.
Vector indexes improve search performance by reducing the number of vector comparisons.
Approximate Nearest Neighbor (ANN) indexes provide fast searches with high recall.
Cosine similarity is the most commonly used metric for semantic search.
Hybrid search combines keyword search with vector search to improve relevance.
Vector search is a core component of Retrieval-Augmented Generation (RAG).
Practice Exam Questions
Question 1
A company is building a chatbot that answers employee questions using internal policy documents. The solution converts both documents and user queries into embeddings before searching for relevant information.
What is the primary purpose of generating embeddings?
A. To compress documents for storage
B. To represent text numerically so semantic similarity can be measured
C. To encrypt sensitive information
D. To improve SQL transaction performance
Answer: B
Explanation: Embeddings convert text into high-dimensional numerical vectors that capture semantic meaning. These vectors enable similarity comparisons that go beyond exact keyword matching.
Question 2
A developer plans to implement vector search against a database containing 30 million document embeddings.
Which approach provides the best balance between scalability and query performance?
A. Sequentially compare every vector
B. Use a clustered index
C. Use an Approximate Nearest Neighbor (ANN) vector index
D. Create additional foreign keys
Answer: C
Explanation: ANN indexes are specifically designed to support efficient vector similarity searches across very large datasets while maintaining high recall and low latency.
Question 3
A user searches for:
“Affordable cloud storage”
The returned documents discuss:
Cost-effective cloud backup
Low-cost online storage
Budget-friendly data storage
Why were these documents returned?
A. SQL wildcard matching
B. Lexical keyword matching
C. Primary key lookup
D. Semantic similarity using vector search
Answer: D
Explanation: Vector search retrieves content based on semantic meaning rather than identical words, enabling related concepts and synonyms to be found.
Question 4
Which statement best describes hybrid search?
A. It combines vector search with keyword or full-text search.
B. It stores vectors in multiple databases.
C. It replaces embeddings with SQL indexes.
D. It searches only relational columns.
Answer: A
Explanation: Hybrid search combines traditional lexical search with semantic vector search, often producing more relevant and comprehensive search results.
Question 5
Why should the same embedding model be used for both document indexing and query generation?
A. It reduces storage costs.
B. It eliminates the need for vector indexes.
C. It ensures vectors exist in the same semantic space for meaningful comparisons.
D. It automatically creates SQL indexes.
Answer: C
Explanation: Embeddings generated by different models may occupy different vector spaces, making similarity calculations unreliable and reducing retrieval quality.
Question 6
What is the primary function of a vector index?
A. Encrypt embedding vectors
B. Reduce the number of vector comparisons during searches
C. Compress relational tables
D. Replace SQL indexes
Answer: B
Explanation: Vector indexes organize embeddings so the search engine evaluates only the most promising candidates instead of comparing every stored vector.
Question 7
A Retrieval-Augmented Generation (RAG) application performs vector search before sending retrieved documents to a large language model.
Why is this retrieval step important?
A. It reduces SQL storage requirements.
B. It converts SQL tables into vectors.
C. It grounds the model with relevant information, improving response accuracy.
D. It eliminates the need for embeddings.
Answer: C
Explanation: RAG retrieves relevant documents that provide context to the LLM, helping produce accurate, current, and evidence-based responses while reducing hallucinations.
Question 8
Which SQL capability is most commonly combined with vector search to narrow search results to specific business data?
A. Metadata filtering using WHERE clauses
B. ALTER TABLE statements
C. Transaction logging
D. Foreign key constraints
Answer: A
Explanation: Combining vector search with structured SQL filters allows applications to restrict results by attributes such as department, region, or document type while maintaining semantic relevance.
Question 9
A developer performs vector similarity searches without creating a vector index.
What is the most likely consequence?
A. Embeddings become corrupted.
B. Query performance decreases significantly as the dataset grows.
C. SQL transactions stop working.
D. Documents cannot be embedded.
Answer: B
Explanation: Without a vector index, the system typically performs an exhaustive comparison against every stored vector, resulting in much slower query performance on large datasets.
Question 10
Which statement best summarizes the role of vector search in AI-enabled database applications?
A. It replaces relational databases.
B. It removes the need for SQL queries.
C. It automatically generates embeddings.
D. It enables retrieval of information based on semantic meaning instead of exact text matching.
Answer: D
Explanation: Vector search is designed to retrieve semantically similar information by comparing embedding vectors, making it a foundational capability for intelligent search, recommendation systems, and RAG-based applications.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Implement hybrid search
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
Hybrid search is a core capability for modern AI-enabled database solutions because it combines the strengths of traditional keyword search and vector (semantic) search. By leveraging both lexical and semantic matching techniques, hybrid search delivers more accurate, relevant, and context-aware search results than either approach alone. Hybrid search is widely used in Retrieval-Augmented Generation (RAG) applications, enterprise knowledge bases, AI assistants, recommendation systems, and intelligent search platforms.
What Is Hybrid Search?
Hybrid search combines multiple search techniques into a single query, typically including:
Keyword search
Full-text search
Vector (semantic) search
Instead of relying on only one search method, hybrid search retrieves candidates from multiple search engines and combines the results using a ranking algorithm.
For example, consider a user searching for:
“How do I reduce Azure storage costs?”
A keyword search might find documents containing the exact terms:
Azure
Storage
Costs
A vector search might retrieve documents discussing:
Lower cloud expenses
Optimize storage spending
Reduce infrastructure costs
Hybrid search combines both result sets and ranks the most relevant documents at the top.
Why Hybrid Search Is Important
Neither keyword search nor vector search is perfect by itself.
Keyword Search Strengths
Keyword search excels at finding:
Exact product names
Error codes
File names
Database object names
Technical terminology
Example:
SQL72014
A keyword search finds documents containing that exact error code.
Keyword Search Weaknesses
Keyword search struggles with:
Synonyms
Different wording
Natural language
Conceptual relationships
Example:
Search:
“Vacation policy”
Document:
“Paid time off guidelines”
Although both describe the same concept, keyword search may not find the document.
Vector Search Strengths
Vector search understands meaning.
Example:
Search:
“Improve application speed”
Documents discussing:
Performance optimization
Query tuning
Faster database execution
can all be returned because their embeddings are semantically similar.
Vector Search Weaknesses
Vector search may struggle with:
Product IDs
Version numbers
Error codes
Exact names
Highly specialized terminology
Example:
Searching for:
SQL71561
works better with keyword search.
Hybrid Search Combines Both Approaches
User Query
↓
Keyword Search
+
Vector Search
↓
Combined Results
↓
Ranking
↓
Top Results
This allows users to benefit from both lexical precision and semantic understanding.
How Hybrid Search Works
A hybrid search implementation generally follows these steps.
Step 1. User Submits a Query
Example:
“How do I configure Azure SQL backups?”
Step 2. Keyword Search Executes
The database searches for:
Azure
SQL
Backups
Configure
using:
Full-text indexes
SQL predicates
Traditional search indexes
Step 3. Vector Search Executes
The same query is converted into an embedding.
Query
↓
Embedding Model
↓
Vector
The vector is compared against stored document embeddings.
Step 4. Merge Results
Suppose keyword search returns:
Document
Score
Backup Overview
95
SQL Backup Guide
90
Vector search returns:
Document
Score
Disaster Recovery
93
Data Protection
88
The system merges these candidate sets.
Step 5. Rank Results
The ranking engine evaluates:
Keyword relevance
Semantic similarity
Metadata
Popularity
Freshness
Business rules
The highest-ranking documents are returned.
Components of a Hybrid Search Solution
Source Documents
Examples include:
PDFs
Product documentation
Knowledge articles
Support tickets
Policies
Emails
SQL records
Full-Text Index
Supports traditional keyword searching.
Optimized for:
Exact phrases
Words
Wildcards
Boolean searches
Embedding Model
Generates vector representations for documents and queries.
Examples:
Azure OpenAI Embeddings
OpenAI embedding models
Sentence Transformers
The same embedding model should be used during indexing and querying.
Vector Index
Stores embeddings for efficient semantic search.
Examples:
HNSW
IVF
Flat index
Product Quantization (PQ)
Ranking Engine
Combines multiple signals into a single relevance score.
Search Pipeline
User Query
↓
Keyword Search
\
\
Ranking Engine
/
/
Vector Search
↓
Combined Results
Both searches occur independently before the results are combined.
Ranking in Hybrid Search
Hybrid search is more than simply combining two result lists.
Each result receives a relevance score based on multiple factors.
Typical ranking signals include:
Keyword score
Vector similarity score
Document freshness
Popularity
User permissions
Metadata
Business importance
The ranking algorithm determines the final ordering.
Metadata Filtering
Hybrid search often includes structured SQL filters.
Example:
WHERE Department = 'Finance'
or
WHERE DocumentType = 'Policy'
The search becomes:
Keyword Search
+
Vector Search
+
Metadata Filters
↓
Ranking
Filtering improves both relevance and performance.
Hybrid Search in RAG
Hybrid search is commonly used in Retrieval-Augmented Generation.
Workflow:
User Question
↓
Hybrid Search
↓
Relevant Documents
↓
Large Language Model
↓
Grounded Response
Benefits include:
Higher-quality context
Reduced hallucinations
More complete retrieval
Better factual accuracy
Example Scenario
Suppose an employee asks:
“How do I access my benefits after changing jobs?”
Keyword search retrieves:
Benefits
Jobs
Vector search retrieves:
Employee transition
HR onboarding
Employment status changes
Hybrid search combines both sets, increasing the likelihood of returning the most relevant documents.
Hybrid Search vs Keyword Search
Feature
Keyword Search
Hybrid Search
Exact terms
Excellent
Excellent
Synonyms
Poor
Excellent
Natural language
Limited
Excellent
Error codes
Excellent
Excellent
Semantic understanding
None
Excellent
AI applications
Limited
Excellent
Hybrid Search vs Vector Search
Feature
Vector Search
Hybrid Search
Semantic understanding
Excellent
Excellent
Exact identifiers
Moderate
Excellent
Error codes
Moderate
Excellent
Product names
Moderate
Excellent
Natural language
Excellent
Excellent
Overall relevance
High
Very High
Benefits of Hybrid Search
Better Relevance
Combines multiple search signals.
Handles Synonyms
Users don’t need exact wording.
Supports Technical Queries
Keyword search finds:
Error codes
File names
Product names
Supports Natural Language
Vector search understands concepts.
Improved User Satisfaction
Users receive better search results.
Better RAG Responses
The LLM receives more relevant context.
Challenges
Increased Complexity
Two search systems must be maintained.
Higher Resource Usage
Both keyword and vector searches execute.
Ranking Tuning
Determining the correct weighting between keyword and semantic scores may require experimentation.
Embedding Maintenance
Embeddings should be regenerated when source content changes significantly or when migrating to a new embedding model.
Common Hybrid Search Scenarios
Enterprise Knowledge Bases
Employees search documentation using natural language.
Customer Support
Support agents retrieve troubleshooting articles using both error codes and descriptive questions.
Product Catalogs
Customers search using product names, descriptions, or intent.
Healthcare
Clinicians search using symptoms while also matching standardized medical terminology.
Legal Research
Lawyers search using statutes, case numbers, and legal concepts.
Financial Services
Analysts search reports using account identifiers and descriptive business questions.
Best Practices
Combine full-text and vector search for production AI applications.
Use the same embedding model during indexing and querying.
Create appropriate full-text and vector indexes.
Apply metadata filters whenever possible.
Tune ranking weights using representative user queries.
Evaluate both precision and recall during testing.
Continuously monitor search quality and user feedback.
Refresh embeddings when source documents change significantly.
Secure search results using role-based access controls and document permissions.
DP-800 Exam Tips
Remember these key points for the exam:
Hybrid search combines traditional keyword search with vector search.
Keyword search excels at exact terms, identifiers, and technical strings.
Vector search excels at semantic meaning and natural language.
Hybrid search generally provides better relevance than either approach alone.
Ranking combines multiple signals, including lexical relevance, semantic similarity, and metadata.
Metadata filtering improves both performance and result quality.
Hybrid search is commonly used in Retrieval-Augmented Generation (RAG) systems.
The same embedding model should be used for both indexing and querying to ensure meaningful vector comparisons.
Practice Exam Questions
Question 1
A company is building an AI-powered knowledge base that must support searches for both exact error codes and natural language questions.
Which search approach is most appropriate?
A. Hybrid search
B. Keyword search only
C. Vector search only
D. Relational indexing only
Answer: A
Explanation: Hybrid search combines keyword and vector search, enabling both exact matching for error codes and semantic matching for natural language queries.
Question 2
A user searches for:
“Improve database response time”
The system returns documents discussing query tuning, indexing strategies, and SQL optimization, even though those exact words were not used.
Which component enabled this behavior?
A. Full-text search
B. Vector search
C. Clustered indexes
D. Foreign key constraints
Answer: B
Explanation: Vector search compares embeddings that capture semantic meaning, allowing conceptually related documents to be retrieved even when different wording is used.
Question 3
What is the primary purpose of the ranking engine in a hybrid search solution?
A. Generate document embeddings
B. Create vector indexes
C. Combine and order results from multiple search methods
D. Encrypt search results
Answer: C
Explanation: The ranking engine merges results from keyword and vector searches and orders them using relevance signals such as lexical score, semantic similarity, freshness, and metadata.
Question 4
Which type of query is generally handled most effectively by keyword search?
A. “How can I reduce cloud expenses?”
B. “Best practices for disaster recovery”
C. “Ways to improve SQL performance”
D. “SQL71561”
Answer: D
Explanation: Exact identifiers such as error codes, product names, and version numbers are best handled using keyword or full-text search.
Question 5
Why is hybrid search commonly used in Retrieval-Augmented Generation (RAG) applications?
A. It eliminates the need for embeddings.
B. It improves retrieval quality by combining lexical and semantic matching.
C. It replaces large language models.
D. It removes the need for vector indexes.
Answer: B
Explanation: Hybrid search retrieves more comprehensive and relevant information than either keyword or vector search alone, providing higher-quality context to the LLM.
Question 6
A search solution first performs keyword search, then vector similarity search, and finally combines both result sets.
Which step typically follows next?
A. Delete duplicate documents from the database.
B. Recreate all vector indexes.
C. Rank the combined results using relevance signals.
D. Generate new embeddings for every document.
Answer: C
Explanation: After gathering candidate documents, the ranking engine evaluates multiple relevance signals to determine the final ordering presented to the user.
Question 7
Which statement best describes metadata filtering in hybrid search?
A. It replaces vector search.
B. It restricts search results using structured attributes such as department or document type.
C. It converts SQL tables into embeddings.
D. It automatically updates document embeddings.
Answer: B
Explanation: Metadata filters narrow the search scope using structured data while still allowing semantic and keyword search within the filtered dataset.
Question 8
A developer configures hybrid search using one embedding model for indexing documents and a different embedding model for processing user queries.
What is the most likely result?
A. Improved semantic accuracy.
B. Reduced index size.
C. Faster query execution.
D. Lower-quality semantic matches because vectors occupy different embedding spaces.
Answer: D
Explanation: Embeddings produced by different models are generally not directly comparable, leading to poorer semantic similarity calculations and less relevant search results.
Question 9
Which advantage does hybrid search have over vector search alone?
A. It supports exact matching for identifiers while preserving semantic search capabilities.
B. It eliminates the need for full-text indexes.
C. It guarantees mathematically perfect search results.
D. It removes the need for metadata.
Answer: A
Explanation: Hybrid search enhances vector search by adding lexical matching, making it more effective for exact terms such as product names, file names, and error codes.
Question 10
Which best practice should a database developer follow when implementing hybrid search?
A. Use different embedding models for documents and queries.
B. Disable metadata filtering to improve semantic search.
C. Combine full-text search, vector search, and structured filtering to improve relevance.
D. Use exhaustive vector search for every production workload regardless of size.
Answer: C
Explanation: A well-designed hybrid search solution combines lexical search, semantic search, and structured metadata filtering to maximize relevance, scalability, and user satisfaction in AI-enabled database applications.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Implement reciprocal rank fusion (RRF)
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
Reciprocal Rank Fusion (RRF) is an important ranking technique used in modern hybrid search systems. It enables AI-enabled database solutions to combine results from multiple search algorithms—such as full-text search and vector search—into a single ranked result set. RRF is widely used in Retrieval-Augmented Generation (RAG), enterprise search, Azure AI Search, recommendation systems, and intelligent database applications because it consistently produces high-quality search results without requiring complex score normalization.
What Is Reciprocal Rank Fusion (RRF)?
Reciprocal Rank Fusion (RRF) is a rank aggregation algorithm that combines multiple independently ranked result lists into one unified ranking.
Instead of comparing the actual relevance scores produced by different search algorithms, RRF considers only the position (rank) of each document within each result list.
This makes RRF particularly effective when combining search methods that produce different types of scores.
For example:
Full-text search may produce BM25 relevance scores.
Vector search may produce cosine similarity scores.
Semantic rerankers may produce AI-generated relevance scores.
Because these scoring systems are different and often not directly comparable, RRF combines rankings instead of raw scores.
Why Is RRF Needed?
Modern AI search systems often execute multiple searches simultaneously.
Example:
User query:
“How do I secure Azure SQL backups?”
The search system performs:
Full-text search
Vector search
Metadata filtering
Optional semantic reranking
Each search returns different documents with different scoring methods.
Without RRF, combining these results would be difficult because:
BM25 scores are not directly comparable to cosine similarity scores.
Different algorithms have different score ranges.
Some algorithms produce probabilities.
Others produce similarity values.
RRF eliminates this problem by using document rankings instead of score values.
Traditional Score Combination Problems
Suppose two searches return:
Keyword Search
Rank
Document
BM25 Score
1
Doc A
98
2
Doc B
91
3
Doc C
88
Vector Search
Rank
Document
Cosine Similarity
1
Doc C
0.95
2
Doc D
0.94
3
Doc A
0.92
Notice:
BM25 scores range around 90–100.
Cosine similarity ranges between approximately -1 and 1 (typically 0–1 for normalized embeddings).
Adding these scores directly would not produce meaningful results.
How RRF Works
RRF ignores the raw scores.
Instead, it assigns each document a score based on its ranking position.
Conceptually:
RRF Score = Σ 1 / (k + rank)
Where:
rank = the document’s position in each result list.
k = a constant (commonly 60) that reduces the impact of very high rankings and smooths the score distribution.
The exact value of k is implementation-specific, but many search platforms—including Azure AI Search—use a default value of 60.
The important DP-800 exam concept is that RRF combines rankings rather than raw relevance scores.
Example of RRF
Suppose two searches return:
Keyword Search
Rank
Document
1
A
2
B
3
C
Vector Search
Rank
Document
1
C
2
A
3
D
RRF rewards documents appearing in both lists.
Document A:
Rank 1 in keyword search
Rank 2 in vector search
Document C:
Rank 3 in keyword search
Rank 1 in vector search
Both receive relatively high RRF scores because they rank well in multiple searches.
Documents appearing in only one list receive lower combined scores.
RRF Search Pipeline
User Query
↓
Keyword Search
\
\
\
RRF
/
/
Vector Search
↓
Combined Ranked Results
Each search executes independently.
RRF merges the rankings.
Why Ranking Is Better Than Combining Scores
Consider two scoring systems.
Keyword search:
95
82
79
Vector search:
0.97
0.94
0.92
These values represent different measurements.
Instead of trying to normalize them, RRF simply uses:
Rank 1
Rank 2
Rank 3
This approach is:
Simpler
More stable
More reliable
Independent of score scales
RRF in Hybrid Search
Hybrid search commonly executes:
Keyword search
Full-text search
Vector search
Each produces candidate documents.
RRF combines them into one ranked list.
Example:
Keyword Results
↓
RRF
↑
Vector Results
↓
Final Results
This is one of the most common implementations in enterprise AI search systems.
RRF in Retrieval-Augmented Generation (RAG)
RAG applications depend on retrieving the most relevant documents.
Workflow:
User Question
↓
Hybrid Search
↓
RRF Ranking
↓
Top Documents
↓
Large Language Model
↓
Grounded Response
Benefits include:
Better retrieval quality
Better grounding
More complete context
Reduced hallucinations
Advantages of RRF
Simple
No complex score normalization is required.
Algorithm Independent
Works with:
BM25
Vector similarity
AI ranking
Other retrieval algorithms
Better Retrieval Quality
Documents consistently ranked highly across multiple search methods naturally rise to the top.
Robust
Minor score differences between search algorithms do not significantly affect results.
Easy to Scale
Additional search algorithms can be incorporated into the fusion process without redesigning the ranking approach.
Example Enterprise Scenario
Suppose an employee searches:
“Configure disaster recovery”
Keyword search returns:
Disaster Recovery Guide
Backup Documentation
Vector search returns:
Business Continuity Planning
Disaster Recovery Guide
Failover Procedures
RRF recognizes that Disaster Recovery Guide appears near the top of both lists and promotes it in the final ranking.
RRF Compared to Score Averaging
Score Averaging
Requires:
Score normalization
Matching score scales
Additional tuning
Problems:
Different algorithms use different scoring methods.
Difficult to compare heterogeneous scores.
Reciprocal Rank Fusion
Uses:
Ranking positions only
Benefits:
Simpler
More reliable
Independent of scoring scales
Common in production AI search systems
RRF Compared to Semantic Reranking
These concepts are related but different.
Reciprocal Rank Fusion
Semantic Reranking
Combines multiple ranked lists
Reorders documents using an AI model
Uses document positions
Uses semantic understanding
Doesn’t read document content
Evaluates document meaning
Runs before semantic reranking in many architectures
Often runs after candidate retrieval
Many enterprise AI search solutions use both techniques:
Keyword search
Vector search
RRF
Semantic reranking
Return results
RRF in AI-Enabled Database Solutions
Modern AI-enabled SQL solutions increasingly combine:
SQL filtering
Full-text search
Vector search
Hybrid search
RRF
Retrieval-Augmented Generation
These capabilities enable intelligent applications to retrieve highly relevant information while leveraging existing relational database technologies.
Performance Considerations
Multiple Searches
Hybrid search requires multiple searches to execute.
This increases computational work compared to using only one search method.
Improved Relevance
The additional processing typically results in significantly better retrieval quality.
Candidate List Size
Most systems apply RRF to the top-ranked candidates from each search rather than the entire dataset.
Low Computational Overhead
RRF calculations are lightweight because they operate on rankings instead of comparing vector values or processing document contents.
Best Practices
Use RRF when combining keyword and vector search results.
Avoid directly comparing raw scores from different retrieval algorithms.
Retrieve an appropriate number of candidate documents from each search before applying RRF.
Combine RRF with metadata filtering when appropriate.
Use semantic reranking after RRF if supported by the platform.
Evaluate retrieval quality using representative business queries.
Monitor precision and recall when tuning hybrid search solutions.
DP-800 Exam Tips
Remember these key points for the exam:
Reciprocal Rank Fusion (RRF) combines ranked search results, not raw relevance scores.
RRF is commonly used in hybrid search systems.
RRF works well because keyword search scores and vector similarity scores are not directly comparable.
Documents ranked highly by multiple search algorithms receive higher final rankings.
RRF is lightweight, scalable, and independent of the underlying retrieval algorithms.
RRF is frequently used in Retrieval-Augmented Generation (RAG) to improve document retrieval before passing context to an LLM.
Semantic reranking and RRF are complementary techniques; RRF typically merges candidate lists before optional semantic reranking.
Practice Exam Questions
Question 1
A developer is combining results from a keyword search and a vector similarity search. The two searches produce different scoring scales.
Which ranking technique is specifically designed to combine these results without comparing the raw scores?
A. Reciprocal Rank Fusion (RRF)
B. Euclidean Distance
C. Product Quantization
D. HNSW
Answer: A
Explanation: RRF combines ranked result lists instead of raw relevance scores, making it ideal for merging results from search algorithms that use different scoring methods.
Question 2
What information does Reciprocal Rank Fusion primarily use when calculating a document’s combined relevance?
A. The document’s embedding values
B. The raw BM25 score
C. The document’s position (rank) in each result list
D. The number of words in the document
Answer: C
Explanation: RRF uses the ranking position of documents in each search result list rather than their raw scores, allowing it to combine heterogeneous search results effectively.
Question 3
Why is RRF commonly used in hybrid search?
A. It generates embeddings automatically.
B. It combines keyword and vector search results using document rankings.
C. It replaces vector indexes.
D. It eliminates full-text search.
Answer: B
Explanation: Hybrid search often combines keyword and vector searches. RRF merges the ranked results without requiring score normalization.
Question 4
A document appears near the top of both keyword search and vector search results.
How will RRF typically treat this document?
A. It will remove it as a duplicate.
B. It will assign it a lower ranking because it appears twice.
C. It will ignore the vector search ranking.
D. It will rank the document higher in the final results.
Answer: D
Explanation: Documents that consistently rank highly across multiple search methods receive higher combined RRF scores and are promoted in the final ranking.
Question 5
Which challenge does RRF help solve?
A. Encrypting document embeddings
B. Creating vector indexes
C. Combining search algorithms that produce different relevance score scales
D. Compressing embedding vectors
Answer: C
Explanation: Because keyword search, vector search, and semantic search often use different scoring systems, RRF combines rankings instead of attempting to compare incompatible scores.
Question 6
Which statement best describes Reciprocal Rank Fusion?
A. It performs semantic reranking by analyzing document content.
B. It combines ranked search results from multiple retrieval methods.
C. It generates vector embeddings.
D. It creates Approximate Nearest Neighbor indexes.
Answer: B
Explanation: RRF is a rank aggregation algorithm that merges multiple ranked lists into a single ordered result set.
Question 7
In a Retrieval-Augmented Generation (RAG) solution, where is RRF typically applied?
A. After the large language model generates its response
B. Before document retrieval begins
C. During the combination of candidate search results before providing context to the LLM
D. During embedding generation
Answer: C
Explanation: RRF is used after multiple retrieval methods return candidate documents and before the final context is passed to the LLM.
Question 8
Which statement accurately compares RRF and semantic reranking?
A. They perform the same function.
B. RRF replaces semantic reranking.
C. Semantic reranking combines ranked lists using reciprocal values.
D. RRF merges ranked results, while semantic reranking uses AI to evaluate document meaning.
Answer: D
Explanation: RRF aggregates ranked lists from multiple search methods, whereas semantic reranking analyzes document content and query meaning to reorder results.
Question 9
What is a key advantage of using RRF instead of averaging raw search scores?
A. It requires complex score normalization.
B. It is independent of the underlying scoring scales used by different search algorithms.
C. It eliminates the need for vector search.
D. It always returns mathematically exact nearest neighbors.
Answer: B
Explanation: RRF avoids the complexities of comparing different scoring systems by relying solely on ranking positions.
Question 10
A database developer is implementing hybrid search in an AI-enabled SQL solution.
Which sequence best reflects a common enterprise retrieval pipeline?
D. Product Quantization → SQL backup → Semantic reranking
Answer: C
Explanation: A common enterprise hybrid search workflow retrieves candidate documents using keyword and vector search, combines them using RRF, optionally applies semantic reranking, and then returns the highest-quality results for use in applications such as RAG.
This post is a part of the DP-800: Developing AI-Enabled Database Solutions Exam Prep Hub. This topic falls under these sections: Implement AI capabilities in database solutions (25–30%) --> Design and implement intelligent search --> Evaluate performance of vector and hybrid search
Note that there are 10 practice questions (with answers) at the end of each section to help you solidify your knowledge of the material. Also, there are 4 practice tests with 30 questions each available from the hub's main page below the exam topics section.
Introduction
Evaluating the performance of vector and hybrid search solutions is a critical responsibility when developing AI-enabled database applications. While implementing vector search is important, ensuring that the search solution consistently returns accurate, relevant, fast, and scalable results is equally essential. Database developers must understand how to measure search quality, optimize retrieval performance, balance latency with accuracy, and monitor search systems over time.
This knowledge is especially important for applications such as:
Retrieval-Augmented Generation (RAG)
Enterprise knowledge search
AI-powered chatbots
Document retrieval
Recommendation systems
Intelligent search applications
Why Performance Evaluation Matters
Unlike traditional SQL queries that typically return deterministic results, vector and hybrid search systems retrieve documents based on statistical similarity.
This means there is always a balance between:
Search speed
Search accuracy
Resource consumption
Scalability
A search system that responds instantly but returns irrelevant documents is not useful.
Likewise, a system that returns perfect results but requires several seconds per query may not satisfy user expectations.
The goal is to optimize the entire search experience.
Key Performance Metrics
Several metrics are commonly used to evaluate vector and hybrid search.
Query Latency
Latency measures how long a search takes to return results.
Example:
User Query
↓
120 ms
↓
Results Returned
Lower latency improves user experience.
Typical enterprise AI search systems aim for response times measured in milliseconds.
Factors affecting latency include:
Index type
Dataset size
Hardware resources
Number of search algorithms executed
Network latency
Number of retrieved documents
Throughput
Throughput measures the number of search requests a system can process within a given time.
Examples:
Searches per second
Queries per minute
Higher throughput enables more concurrent users.
Throughput depends on:
CPU
Memory
Index efficiency
Parallel processing
Database architecture
Recall
Recall measures how many relevant documents are successfully retrieved.
Example:
Relevant documents:
A
B
C
D
E
Returned documents:
A
B
C
X
Y
Recall:
3 / 5 = 60%
Higher recall generally improves RAG quality because more relevant information is available to the large language model.
Precision
Precision measures how many returned documents are actually relevant.
Example:
Returned:
A
B
C
X
Y
Relevant:
A
B
C
Precision:
3 / 5 = 60%
High precision reduces irrelevant search results.
F1 Score
The F1 Score combines precision and recall into a single metric.
It is especially useful when both false positives and false negatives matter.
Higher F1 scores indicate a better overall balance between retrieving relevant documents and avoiding irrelevant ones.
Mean Reciprocal Rank (MRR)
MRR measures how highly the first relevant result appears in the ranked list.
Example:
Relevant document positions:
Query
First Relevant Result
Query 1
Rank 1
Query 2
Rank 2
Query 3
Rank 4
Higher MRR indicates users find relevant information more quickly.
MRR is commonly used when evaluating question-answering systems and RAG applications.
Normalized Discounted Cumulative Gain (NDCG)
NDCG measures:
Ranking quality
Position of relevant documents
Graded relevance
Unlike recall, NDCG rewards placing the most relevant documents near the top.
This is especially important because users rarely read beyond the first few search results.
Evaluating Vector Search
When evaluating vector search, developers typically measure:
Recall
Precision
Latency
Index build time
Memory usage
Storage requirements
Index Performance
Questions include:
How quickly are searches completed?
How much memory does the index require?
How long does index creation take?
How efficiently are inserts handled?
Search Quality
Evaluate:
Are similar documents retrieved?
Are unrelated documents excluded?
Are synonyms recognized?
Does semantic similarity match user expectations?
Evaluating Hybrid Search
Hybrid search combines:
Full-text search
Vector search
Metadata filtering
Ranking algorithms such as Reciprocal Rank Fusion (RRF)
Optional semantic reranking
Because more components participate, additional evaluation is necessary.
Ranking Quality
Developers evaluate whether:
Exact matches appear near the top.
Semantically relevant documents are included.
Duplicate results are minimized.
Ranking is consistent.
Hybrid Relevance
Example query:
“Reduce Azure costs”
Good hybrid results may include:
Azure cost optimization
Cloud spending reduction
Budget management
Reserved capacity guidance
Poor hybrid results may include unrelated Azure topics.
Measuring Retrieval Quality
Many organizations create benchmark datasets.
Example:
Question:
“How do I configure VPN access?”
Expected documents:
VPN Setup Guide
Remote Access Policy
Authentication Configuration
The search system is evaluated based on whether these expected documents appear in the returned results.
Human Evaluation
Automated metrics cannot evaluate every aspect of search quality.
Organizations often perform manual reviews.
Experts examine:
Relevance
Completeness
Ranking quality
Consistency
Human evaluation is particularly valuable for RAG applications.
Offline Evaluation
Offline testing uses historical datasets.
Advantages:
Repeatable
Safe
Fast
No production impact
Developers compare:
Multiple embedding models
Index types
Similarity metrics
Ranking algorithms
Online Evaluation
Online evaluation uses live users.
Common techniques include:
A/B Testing
Group A:
Current search system
Group B:
New search implementation
Metrics compared include:
Click-through rate
User satisfaction
Search success
Session completion
User Feedback
Collect feedback such as:
Helpful
Not Helpful
User feedback helps improve future search tuning.
Factors Affecting Vector Search Performance
Embedding Quality
Poor embeddings reduce retrieval quality regardless of index performance.
Always choose embedding models appropriate for the domain.
Similarity Metric
Common choices:
Cosine similarity
Dot product
Euclidean distance
Using the wrong metric can reduce search accuracy.
Vector Index Type
Different index types provide different tradeoffs.
Index
Speed
Recall
Memory
Flat
Slow
Highest
Moderate
HNSW
Very Fast
Very High
High
IVF
Fast
High
Moderate
IVF + PQ
Very Fast
Moderate-High
Low
Candidate Set Size
Returning more candidate documents often increases recall.
However:
Latency increases.
More data must be reranked.
LLM token usage increases in RAG.
Balance is important.
Metadata Filtering
Filtering improves:
Precision
Latency
Example:
WHERE Department ='Finance'
Searching fewer documents reduces processing time while improving relevance.
Evaluating Hybrid Search Components
Keyword Search
Evaluate:
Exact matches
Phrase matching
Synonym handling
Technical terminology
Vector Search
Evaluate:
Semantic understanding
Related concepts
Context awareness
Reciprocal Rank Fusion (RRF)
Evaluate:
Ranking consistency
Combined relevance
Candidate diversity
Semantic Reranking
Evaluate:
Final ranking quality
User satisfaction
Response accuracy
Common Performance Bottlenecks
Missing Vector Index
Searching every embedding significantly increases latency.
Poor Embeddings
Weak embeddings reduce semantic quality.
Excessive Candidate Retrieval
Retrieving hundreds of documents unnecessarily increases reranking and LLM processing time.
Large Embedding Dimensions
Higher-dimensional embeddings require:
More storage
More memory
More computation
Frequent Index Rebuilds
Rebuilding indexes too frequently can consume unnecessary resources.
Use incremental updates where supported.
Optimization Techniques
Choose the Correct Index
Examples:
Small datasets → Flat
Medium datasets → HNSW
Very large datasets → IVF or IVF + PQ
Tune Candidate Count
Retrieve only the number of documents needed.
Use Metadata Filters
Reduce unnecessary searches.
Optimize Embeddings
Select high-quality embedding models.
Use Hybrid Search
Combining lexical and semantic search generally improves relevance.
Apply Semantic Reranking
Use reranking on a limited candidate set to improve final result quality.
Performance Monitoring
Production systems should monitor:
Average latency
Peak latency
Recall
Precision
Throughput
Memory usage
Index size
Search failures
User satisfaction
Search abandonment rate
Monitoring enables proactive tuning as data volumes and usage patterns evolve.
Best Practices
Benchmark search quality before deployment.
Measure both latency and retrieval quality.
Use benchmark datasets with known expected results.
Combine automated metrics with human evaluation.
Tune candidate retrieval size based on workload.
Select the appropriate vector index for dataset size.
Monitor production search metrics continuously.
Refresh embeddings when source data changes significantly.
Evaluate hybrid search using realistic business queries.
Test changes in a staging environment before production deployment.
DP-800 Exam Tips
Remember these key points for the exam:
Vector search performance should be evaluated using both speed and retrieval quality metrics.
Recall measures how many relevant documents are retrieved.
Precision measures how many returned documents are relevant.
MRR evaluates how quickly users encounter the first relevant result.
NDCG evaluates the quality of document ranking.
Hybrid search should be evaluated as a complete pipeline, including keyword search, vector search, RRF, and optional semantic reranking.
Metadata filtering improves both precision and performance.
Human evaluation remains important because automated metrics cannot fully measure search usefulness.
Production systems should continuously monitor latency, recall, throughput, and user satisfaction.
Practice Exam Questions
Question 1
A database developer is evaluating a vector search solution. Which metric measures the percentage of retrieved documents that are actually relevant?
A. Recall
B. Latency
C. Precision
D. Throughput
Answer: C
Explanation: Precision measures the proportion of retrieved documents that are relevant. High precision indicates that the search results contain few irrelevant documents.
Question 2
A Retrieval-Augmented Generation (RAG) application consistently retrieves only three of the five relevant documents for most user queries.
Which performance metric is primarily affected?
A. Recall
B. Mean Reciprocal Rank (MRR)
C. Throughput
D. Query latency
Answer: A
Explanation: Recall measures how many relevant documents are successfully retrieved. Missing relevant documents lowers the recall score.
Question 3
Which metric evaluates how quickly users encounter the first relevant search result?
A. F1 Score
B. Mean Reciprocal Rank (MRR)
C. Precision
D. Throughput
Answer: B
Explanation: MRR evaluates the ranking position of the first relevant result, rewarding systems that place useful documents near the top of the results list.
Question 4
A search solution returns highly relevant documents, but users complain that responses take several seconds.
Which performance metric should the development team investigate first?
A. Index build time
B. Storage utilization
C. Embedding dimension
D. Query latency
Answer: D
Explanation: Query latency measures the time required to return search results. High latency negatively impacts the user experience, even when retrieval quality is good.
Question 5
Which statement best describes hybrid search performance evaluation?
A. Only vector search accuracy needs to be measured.
B. Only keyword search latency matters.
C. Evaluation should include keyword search, vector search, ranking quality, and overall retrieval performance.
D. Performance is determined solely by embedding size.
Answer: C
Explanation: Hybrid search combines multiple retrieval methods, so developers should evaluate the complete search pipeline rather than a single component.
Question 6
A developer increases the number of candidate documents retrieved before semantic reranking.
What is the most likely tradeoff?
A. Lower latency and reduced memory usage
B. Higher recall but increased latency and reranking costs
C. Reduced recall with faster indexing
D. Elimination of vector indexing requirements
Answer: B
Explanation: Retrieving more candidate documents increases the likelihood of finding relevant information but also increases processing time, reranking effort, and LLM token usage.
Question 7
Why is human evaluation still valuable when assessing AI-powered search systems?
A. Automated metrics cannot fully measure user relevance and usefulness.
B. Human evaluation eliminates the need for benchmark datasets.
C. Human reviewers create vector indexes.
D. Human evaluation replaces latency testing.
Answer: A
Explanation: While automated metrics quantify retrieval quality, human reviewers can assess contextual relevance, completeness, and overall usefulness from a user perspective.
Question 8
Which optimization technique can improve both search precision and query performance?
A. Increasing embedding dimensions indefinitely
B. Removing vector indexes
C. Using metadata filtering to narrow the search scope
D. Returning every matching document
Answer: C
Explanation: Metadata filters reduce the number of candidate documents that must be searched, improving both relevance and performance.
Question 9
Which performance metric evaluates the overall quality of document ranking by giving more credit when highly relevant documents appear near the top of the results?
A. Recall
B. Precision
C. Throughput
D. Normalized Discounted Cumulative Gain (NDCG)
Answer: D
Explanation: NDCG measures ranking quality by considering both document relevance and the position of documents in the ranked results, rewarding systems that place the most relevant items first.
Question 10
A development team wants to compare two different embedding models before deploying a new search solution.
Which evaluation approach is most appropriate?
A. Online A/B testing only
B. Disable benchmarking and rely on production feedback
C. Conduct repeatable offline testing using benchmark datasets with expected search results
D. Measure only CPU utilization
Answer: C
Explanation: Offline benchmarking with known datasets enables developers to compare embedding models, similarity metrics, and indexing strategies safely and consistently before deploying changes to production.