As generative AI architectures evolve, practitioners have begun questioning whether specialized vector databases are strictly necessary. Discussions online suggest that developers can bypass vector storage entirely by using simple text utilities like grep from 19730:11, leveraging expanding model context windows, or relying on vector search capabilities built directly into traditional SQL and NoSQL engines. Martin Keen explains that answering whether vector databases are still required depends heavily on the specific workload, illustrating this through a four-tier retrieval pyramid1:18.
Keen first outlines the three major arguments against dedicated vector databases. First, developers can implement agentic keyword search1:57, where an autonomous AI agent iteratively searches and refines keyword queries using tools like grep rather than relying on one-shot semantic matching. Second, modern frontier models feature massive context windows3:06 capable of processing roughly a thousand times more text than earlier generations, making zero-retrieval prompting feasible. Third, generating and maintaining vector embeddings incurs significant embedding cost and overhead3:26, especially when embedding models change, prompting teams to favor vector indexes inside existing databases4:10 rather than spinning up dedicated infrastructure.
However, climbing higher up the pyramid becomes necessary when workload complexity scales. While dumping entire document sets into an LLM context seems convenient, Keen points out that context bloat degrades accuracy5:57 and dramatically inflates token processing expenses. Stepping up to keyword search solves volume issues, but it fails whenever queries and source documents do not share identical vocabulary—a phenomenon known as the semantic gap6:58. In an IT support scenario, a query like "how do I reset my password?" shares zero words with a resolution ticket titled "credentials loop after update," meaning grep returns nothing6:48 while semantic vector search maps them as close neighbors.
Finally, when teams require semantic search, Keen distinguishes between using a standard database with an integrated vector index versus a standalone vector engine. While individual embeddings consume only kilobytes, maintaining millions of high-dimensional vectors in memory7:49 places severe memory and performance strain on general-purpose databases. For enterprise workloads requiring low-latency queries across billions of vectors8:12, a dedicated vector database remains the ideal solution. Keen summarizes the evaluation into two fundamental questions8:21: whether vector search is required to bridge the semantic gap, and whether vector volume justifies dedicated infrastructure.
