The article explains why RAG systems cannot rely on MySQL for embedding storage, shows the O(n) brute‑force search latency for hundreds of thousands of chunks, and demonstrates how vector databases with ANN indexes such as HNSW or IVFFLAT provide millisecond‑level response, high recall, and scalable storage.
The article examines RAG vector retrieval filtering strategies, comparing pre‑filtering (filter before vector search) and post‑filtering (filter after ANN search), and introduces single‑stage filtering, discussing their principles, trade‑offs, suitable scenarios, and architectural implications for accuracy and performance.
The article dissects latency in high‑concurrency RAG Agent pipelines, showing how retrieval, re‑ranking, and LLM generation each contribute milliseconds of delay, and presents system‑level tactics—from ANN index tuning and partitioned search to vLLM PagedAttention, continuous batching, speculative decoding, model quantization, routing, semantic caching, and pipeline parallelism—to dramatically cut end‑to‑end response time.
The article explains how embedding techniques encode semantic information into numeric vectors, covering Word2Vec and GloVe fundamentals, BERT anisotropy, SimCSE contrastive learning, alignment and uniformity metrics, ANN index structures such as HNSW, IVF and PQ, Matryoshka representation learning, practical deployment challenges, and evaluation best practices.
This article explains what vectors are, why traditional relational databases struggle with high‑dimensional similarity queries, and how the open‑source Milvus vector database efficiently stores, indexes, and retrieves massive vectors for AI applications such as semantic search, image matching, and recommendation.
Vektor is a high‑performance, pure‑PHP vector database that stores data on disk, uses the HNSW algorithm for approximate nearest‑neighbor search, and operates with zero RAM overhead, offering both an embeddable library and a standalone HTTP API server with simple installation and configuration steps.
This article explains the core concepts of vector database indexing, details the composition of Milvus indexes—including data structures, quantization methods, and specific algorithms like IVF, HNSW, DISKANN, PQ, RABITQ, PRQ, SCANN, AISAQ, and MINHASH_LSH—and offers speculation on future developments.
This article explains how high‑dimensional vectors enable semantic AI search, compares exact and approximate nearest‑neighbor algorithms, examines the challenges of large‑scale vector storage, and evaluates AWS S3 Vectors' architecture, pricing, and hybrid solutions for cost‑effective, high‑performance retrieval.
The paper introduces SOGAIC, a scalable overload‑aware graph‑based index construction system for billion‑scale vector similarity search that uses adaptive overlapping partitioning and load‑balanced distributed scheduling to cut construction time by 47.3% while maintaining high recall.
This article explains the principles and practical implementation of vector retrieval in StarRocks, covering approximate nearest‑neighbor algorithms, index design, query planning, performance optimizations, real‑world case studies, and future challenges, showing how query latency dropped from 15 seconds to 2 seconds while cutting costs to a third.
This article analyzes a GPU‑based approximate nearest neighbor (ANN) retrieval solution built on NVIDIA's RAFT library, detailing algorithm selection, offline indexing tricks, batch online search design, performance results on a 25‑million‑vector workload, and cost‑saving implications for large‑scale search services.
This article examines how Baidu and NVIDIA leveraged the open‑source RAFT library to build a GPU‑accelerated approximate nearest neighbor (ANN) retrieval system, detailing algorithm choices, offline indexing, online batch processing, performance results, and practical guidelines for deploying ANN on GPUs.
The article details how JD's advertising retrieval platform tackles the core challenge of balancing limited compute resources with massive data by optimizing compute allocation, improving model scoring efficiency, and enhancing iteration speed through distributed execution graphs, adaptive algorithms, and platform‑level infrastructure improvements.
With the rise of LLMs, vector search and vector databases have become essential for extending model memory, and this article explains the principles, algorithms, design choices, implementation details, and performance results of ByteHouse’s cloud‑native vector retrieval engine.
Meituan Waimai’s search team built a GPU‑accelerated, mixed vector‑and‑scalar retrieval engine that supports billions of items, achieving over 99% recall and up to 89% latency reduction by combining pre‑filtering, optimized data layouts, multi‑GPU parallelism, and FP16 precision.
This article explains the fundamentals of vector databases, how high‑dimensional vector data is generated and stored, reviews common ANN search algorithms such as Flat, k‑means and LSH, discusses benchmarking and product selection, and demonstrates practical integration of vector stores with LLMs using LangChain and Python code.
Douyin tackled vector‑retrieval challenges by optimizing HNSW and creating a high‑performance IVF algorithm, implementing custom scalar quantization, SIMD acceleration, and a DSL‑driven engine that merges filtering with search, then built a cloud‑native, storage‑compute‑separated vector database (VikingDB) delivering sub‑10 ms latency, real‑time updates, multi‑tenant support, and secure, scalable retrieval for LLM‑driven applications.
Baidu has open‑sourced its high‑performance, trillion‑scale vector search engine Puck—originally built for ultra‑large image‑search workloads, winner of multiple BIGANN categories, now supporting diverse embeddings alongside the medium‑size Tinker algorithm—to accelerate community innovation, improve code quality, and broaden AI retrieval applications across search, recommendation and cloud services.
This article outlines Douyin’s step‑by‑step engineering evolution of its cloud‑native vector database, covering the background of vector search, core concepts, algorithmic optimizations, storage‑compute separation, streaming updates, multi‑tenant orchestration, and future applications such as large language model integration.
This article explains how vector search converts unstructured data such as speech, images, video, and text into high‑dimensional embeddings, explores common algorithms like Brute‑Force, ANN, and HNSW, and presents optimization techniques that dramatically improve recall and query‑per‑second performance for large‑scale AI retrieval systems.
Puck, Baidu’s open‑source Approximate Nearest Neighbor engine built on the proprietary Puck and Tinker algorithms, delivers high recall, accuracy and throughput across tiny to trillion‑scale datasets, outperforms rivals in benchmarks—including first‑place BIGANN 2021—while offering a simple, extensible API, proven reliability in dozens of Baidu services, and an Apache 2.0 license encouraging community contributions.
This article demystifies vector databases by first explaining the concept with a five‑year‑old analogy, then expanding to technical details for developers, covering how embeddings work, the differences from relational databases, ANN search, indexing, similarity metrics, and why vector stores outperform raw NumPy arrays for large‑scale similarity retrieval.
This article explains how Cassandra’s newly added vector data type and ANN search capabilities empower AI developers to store, index, and query high‑dimensional embeddings at scale, enabling use cases such as image retrieval, recommendation, and large‑language‑model integration.
This article explains the challenges of large‑scale vector retrieval, compares Faiss index types such as brute‑force, graph‑based and product quantization, and details how product quantization works, its memory‑speed trade‑offs, hierarchical quantization, and practical hyper‑parameter tuning.
The inaugural BigANN competition, organized by NeurIPS, showcased large‑scale ANN research, and Baidu's self‑developed PUCK algorithm secured top scores across all four tracks by leveraging multi‑layer quantization, two‑level inverted indexing, and extensive system‑level optimizations.
On December 6, Kuaishou and Tsinghua University’s joint team secured first place in the NeurIPS'21 Billion‑Scale Approximate Nearest Neighbor Search Challenge by leveraging a FAISS‑optimized, memory‑efficient KST_ANN algorithm that achieved over 6% higher recall on multiple billion‑scale datasets, showcasing the practical impact of large‑scale vector retrieval in AI‑driven services.
The article describes the design, challenges, architecture, key features, algorithm optimizations, and future roadmap of Kuaishou's Starry vector retrieval platform, which delivers high‑performance, high‑reliability, and easy‑to‑use large‑scale ANN search for diverse business scenarios.
Baidu’s rich‑media retrieval system combines CNN‑based feature extraction with an Approximate Nearest Neighbor engine called GNOIMI, employing hierarchical clustering, product quantization, and optimized indexing to achieve sub‑millisecond search over billions of images, videos and audio, supporting anti‑spam, recommendation and risk‑control across dozens of services.
SimSvr is a high‑performance, distributed feature‑retrieval component designed for recommendation systems that supports billion‑scale indexes, sub‑millisecond query latency, real‑time and batch updates, multi‑model AB‑testing, and advanced filtering, all while running on Tencent's production workloads.
DeepMatch is an open‑source Python library that implements several mainstream deep‑learning based recall‑matching algorithms, provides easy installation via pip, detailed usage examples with code, and supports exporting user and item vectors for ANN search, making it ideal for rapid experimentation and learning in recommendation systems.
