Build fluency in the vocabulary of navigating a multi-layer graph to find approximate nearest neighbors quickly.
0 / 5 completed
1 / 5
A teammate explains that a vector database builds a multi-layer graph where each vector is linked to a small set of nearby neighbors, so a similarity search can hop through a few long-range links at the top layer before descending to short-range links, finding a very good approximate match in logarithmic time instead of comparing the query against every stored vector. What approximate-nearest-neighbor search structure is being described?
Hierarchical Navigable Small World (HNSW) indexing builds a multi-layer graph of vectors, with sparse long-range links at the top layers for fast coarse navigation and dense short-range links at the bottom layer for fine-grained precision, so a query only touches a small fraction of the stored vectors to find an approximate nearest neighbor instead of scanning the entire dataset. A DNS zone transfer is an unrelated concept about replicating name server records. This layered-graph-navigate-to-nearest approach is exactly why HNSW is the default index type behind most production vector databases and libraries like FAISS, pgvector, and Pinecone.
2 / 5
During a design review, the team adopts HNSW indexing for a semantic-search feature over one hundred million embeddings that must return results in under fifty milliseconds. Which capability does this provide?
HNSW indexing here provides sub-linear approximate search latency, since the graph traversal only visits a small, logarithmic-sized fraction of the stored vectors instead of scanning the whole collection. A brute-force scan that computes the distance from the query to every one of the hundred million stored vectors on every single search is the alternative this avoids. This behavior is exactly why HNSW indexing is favored in this kind of scenario.
3 / 5
In a code review, a dev notices a similarity-search endpoint computes the cosine distance between the query vector and every one of several million stored vectors on every request, instead of querying an HNSW graph that would only visit a small fraction of them. What does this represent?
This is a missed HNSW indexing-opportunity, since an HNSW index would let each query touch only a small, logarithmic-sized fraction of the stored vectors. A cache eviction policy is an unrelated concept about discarded cache entries. This pattern is exactly the kind of gap a reviewer flags once the tradeoffs are understood.
4 / 5
An incident report shows a semantic-search endpoint's latency grew linearly with the size of the embedding collection until it took several seconds per query, because every request performed a brute-force distance computation against the entire collection. What practice would prevent this?
Building an HNSW index over the embedding collection so each query traverses a small fraction of the graph instead of scanning every stored vector. Continuing the prior approach regardless of the risk it has already caused is exactly what led to the incident described here. This fix is the standard remedy once the root cause is confirmed.
5 / 5
During a PR review, a teammate asks why the team reaches for HNSW indexing instead of an exact brute-force k-nearest-neighbor scan. What is the reasoning?
HNSW trades a small amount of recall accuracy, since it returns an approximate rather than guaranteed-exact nearest neighbor, for search latency that stays fast as the collection grows into the millions, while a brute-force scan always returns the exact nearest neighbors but its latency grows linearly with collection size. This is exactly why HNSW indexing is favored when collections are large enough that a linear scan becomes too slow, while an exact brute-force k-nearest-neighbor scan remains acceptable when the collection is small enough, or exactness is required often enough, that a full scan stays fast.
What does the "HNSW Indexing Vocabulary" vocabulary exercise cover?
This exercise tests real IT vocabulary related to hnsw indexing vocabulary through 5 multiple-choice questions, each built from realistic workplace sentences rather than abstract definitions.
Is this vocabulary exercise free to use?
Yes. Every exercise on CoderSlingo, including this one, is completely free — no account, sign-up, or payment required.
How many questions does this exercise have?
This exercise has 5 questions. Each one shows a real-world sentence or scenario with multiple-choice options and an explanation once you answer.
What happens after I answer a question?
You'll see immediate feedback showing whether your answer was correct, along with a short explanation of why — then a button to move to the next question, and a full results screen at the end.
Can I retry the exercise if I get questions wrong?
Yes. Once you reach the results screen, click "Try again" to reset your answers and go through the exercise from the start as many times as you like.
Do I need to create an account to take this exercise?
No account is needed. Your answers are scored in your browser during the session — nothing is saved to a server, so you can jump straight in.
Is my progress saved if I leave the page?
No — progress within an exercise resets if you navigate away or reload. Each exercise is short enough to complete in a few minutes in one sitting.
Are these vocabulary exercises connected to other topics?
Yes — browse the full vocabulary exercises hub to find related modules covering adjacent IT topics and roles.
How is this different from reading a glossary or blog article?
Exercises like this one are active recall drills — you have to choose the correct term or phrasing yourself, which builds retention faster than passively reading a definition.
Where can I find more vocabulary exercises?
Browse the full Vocabulary exercises hub for hundreds of modules covering Agile, DevOps, security, databases, architecture, and more — organised by IT role and skill.