Tagged articles
HNSW
46 articles · Page 1 of 1
Alibaba Cloud AI Search achieves top rankings on VDBBench vector retrieval, Big5 and Tantivy traditional search benchmarks, and MMEB multimodal document retrieval through full-stack optimizations including FalconSeek kernel improvements for HNSW, native query execution, and the Ops-Colqwen3-4B multimodal embedding model.
AI searchBig5Elasticsearch
0 likes · 17 min read

This tutorial explains vector databases from fundamentals to production: representing data as vectors, embedding models for semantic search, ANN algorithms like HNSW and IVF, hands-on ChromaDB demo for RAG, and comparison of production databases Milvus, Qdrant, Pinecone, and Weaviate with common pitfalls.
ANN algorithmsChromaDBHNSW
0 likes · 14 min read

Booking.com benchmarked OpenSearch and Weaviate with 100M embeddings across pure KNN, filtered search, and mixed read/write workloads, finding Weaviate's integrated storage-engine design delivered stable low latency at high concurrency and writes, cutting compute costs by 40%.
Booking.comHNSWLSM storage
0 likes · 13 min read

This article explains how to implement RAG within a lakehouse architecture by treating the vector database as a derived retrieval index rather than a separate system, covering embedding pipelines, Milvus index trade-offs, hybrid search, real-time updates via Flink, consistency governance, and troubleshooting common production issues.
ConsistencyEmbeddingFlink
0 likes · 22 min read

This article explains why vector databases are general-purpose similarity search engines beyond RAG, covering embedding model selection (BGE), non-RAG use cases like recommendation and anomaly detection, core operations with ChromaDB and HNSW, selection criteria for ChromaDB, FAISS, Milvus, and Pinecone, and five practical engineering lessons on recall evaluation, API workarounds, distance vs similarity, chunking strategies, and metadata filtering.
ChromaDBEmbeddingHNSW
0 likes · 12 min read

This article explains why vector databases like Milvus and Qdrant are necessary for AI applications despite the existence of relational databases like MySQL, detailing differences in indexing (ANN vs B+ trees), query logic (similarity vs exact match), consistency models, data structures, and ideal use cases such as RAG and recommendation systems.
AI embeddingsANN indexesHNSW
0 likes · 6 min read

This comprehensive guide covers end-to-end RAG system operations, from vector database selection and workload profiling to HNSW parameter tuning, filtering strategies, index freshness monitoring, embedding upgrades, capacity planning, backup validation, and troubleshooting methodologies with concrete examples and evaluation frameworks.
Backup RecoveryHNSWMilvus
0 likes · 64 min read

This article provides a comprehensive analysis of Milvus 3.x's evolution from a vector database to a Lake-Native retrieval engine, covering its architecture, External Collection for zero-copy indexing on data lakes, Storage V3, ANN indexes (HNSW, IVF, DiskANN), hybrid search, and production RAG architectures with performance tuning and troubleshooting guidance.
ANN IndexDiskANNHNSW
0 likes · 37 min read

This article provides a step-by-step verified guide to implementing vector search in Easysearch 2.4.0, covering index creation with dense_vector fields, data ingestion with embeddings, k-NN query pitfalls including the mandatory 'k' parameter, and the critical distinction between compound queries and RRF-based hybrid search for combining keyword and semantic search.
EasysearchEmbeddingHNSW
0 likes · 10 min read

Intel's Xeon AMX enables exact vector partitioning in LanceDB at speeds matching approximate methods, boosts HNSW query throughput by 1.38x via batching, and accelerates embedding, CLIP, Whisper, and video tasks on CPU, demonstrating a reusable optimization path for AI data lakes.
AI Data LakeCLIPEmbedding
0 likes · 13 min read

INFINI Easysearch 2.4.0 integrates HNSW vector search directly into the kernel, eliminating the need for a separate k-NN plugin, and adds hybrid keyword-vector queries with weighted scoring, while maintaining full compatibility with Elasticsearch 8.19.17 clients and APIs.
EasysearchElasticsearch compatibilityHNSW
0 likes · 5 min read

This article analyzes Redis 8's new AI capabilities including vector search with HNSW and int8 quantization, the native Vector Sets data type, LangCache semantic caching for LLM cost reduction, and the Iris real-time context engine for agent memory, with code examples and a comparison of when to use each feature.
AI infrastructureHNSWRedis
0 likes · 9 min read

This article details Redis's evolution into a comprehensive AI data infrastructure, covering its four core capabilities—vector search with hybrid queries, native Vector Sets data type, LangCache semantic caching for 70% LLM cost reduction, and Redis Iris context engine for AI agent memory—with technical implementations, performance benchmarks, and use-case recommendations.
AI agent memoryHNSWJava
0 likes · 16 min read

Alibaba Cloud Elasticsearch on ES 9.4, using the FalconSeek HNSW engine, achieves 82,520 QPS at 0.98 recall with a 1.8 ms P99 latency in VectorDBBench, and the article explains the end‑to‑end architectural redesign—including quantized candidate recall, batch distance computation, hot‑data layout, on‑demand re‑ranking, and segment lifecycle integration—that makes these results possible.
AI searchElasticsearchFalconSeek
0 likes · 17 min read


ITPUBAug 5, 2026 · Artificial Intelligence
An interview story reveals that storing embeddings in MySQL forces a full‑table scan, leading to second‑level latency, while production‑grade RAG requires a vector database with ANN indexing such as HNSW or IVFFLAT, offering millisecond response, high recall, and scalable storage.
ANNHNSWIVFFLAT
0 likes · 20 min read

This article explains why Retrieval‑Augmented Generation is needed, walks through the offline and online pipeline, details knowledge sources, embedding models, chunking strategies, similarity metrics, the HNSW index, multi‑path recall, RRF fusion and cross‑encoder reranking, and summarizes practical takeaways for building effective RAG systems.
Cross-EncoderEmbeddingHNSW
0 likes · 36 min read

This article compares leading open‑source vector databases—including Redis, Milvus, Weaviate, Qdrant, Chroma, pgvector, and Faiss—by examining their architectures, performance benchmarks, deployment models, and suitability for production AI workloads, helping readers choose the right solution for their needs.
AIHNSWRedis
0 likes · 14 min read

This article examines the evolution of e‑commerce search from simple keyword matching to multimodal, cross‑modal retrieval, explains the core embedding and vector‑search technologies, compares dense, sparse and hybrid models, and demonstrates how Elasticsearch Serverless and Alibaba Cloud AI Search Platform enable a low‑cost, serverless, high‑performance end‑to‑end multimodal product search solution.
AI search platformBBQElasticsearch Serverless
0 likes · 21 min read

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.
ANNHNSWRAG
0 likes · 19 min read

The article explains why brute‑force vector search is painfully slow, introduces Flat, IVF, and HNSW index structures, compares their speed, memory and accuracy, shows common pitfalls, provides production‑grade Python code, and presents benchmark results that demonstrate HNSW’s superior speed‑accuracy trade‑off.
AIFaissHNSW
0 likes · 12 min read

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.
ANNBERTEmbedding
0 likes · 23 min read

This article walks through deploying Milvus with Docker Compose, creating a persistent collection, tuning HNSW indexes, integrating LangChain.js for semantic retrieval, and covering performance tips and common pitfalls to run a production‑grade vector database.
Docker ComposeHNSWLangChain
0 likes · 21 min read

The article explains how diverse data can be represented as high‑dimensional vectors, describes exact and approximate nearest‑neighbor search, explores vector quantization, product quantization, locality‑sensitive hashing, and HNSW graphs, and analyzes their speed, accuracy, and memory trade‑offs for large‑scale similarity retrieval.
HNSWLSHVector Search
0 likes · 16 min read

This guide explains how traditional relational databases and SQL struggle with semantic queries needed for AI applications, introduces vector databases and HNSW indexing for efficient similarity search, compares their architectures, and presents a real‑world fraud detection system that combines both technologies.
AIB+TreeHNSW
0 likes · 17 min read

This article explains why vector databases are needed for semantic search of unstructured data and provides a detailed, step‑by‑step comparison of three core vector similarity algorithms—cosine similarity, Flat Index, IVF, and HNSW—highlighting their trade‑offs in accuracy and speed.
HNSWIVFVector Search
0 likes · 10 min read

This guide introduces PHPVector, a pure‑PHP vector database that combines HNSW‑based approximate nearest‑neighbor search with BM25 full‑text ranking, showing installation, document insertion, vector and text queries, hybrid ranking modes, configuration options, distance metrics, tuning tips, and persistence mechanisms.
AIBM25HNSW
0 likes · 10 min read

This article presents a comprehensive, end‑to‑end solution for multimodal product search, detailing the evolution from keyword to image‑based queries, the core embedding and vector retrieval technologies, practical Elasticsearch Serverless integration, quantization methods, and a complete demo workflow for building a high‑performance, low‑cost search platform.
AI search platformElasticsearchEmbedding
0 likes · 21 min read

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.
ANNEmbedding SearchHNSW
0 likes · 7 min read

The article surveys emerging vector databases, explains how various vector‑search algorithms such as FLAT, IVF, HNSW, DiskANN and ScaNN differ in accuracy, speed, memory use and build time, and provides practical guidance for choosing the right index based on data size, latency and resource constraints.
Approximate Nearest NeighborDiskANNHNSW
0 likes · 9 min read

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.
ANNHNSWMilvus
0 likes · 32 min read

This article explains a system that combines large language models with multimodal vector retrieval to automatically understand user intent and instantly recommend the most relevant icons, detailing the workflow, semantic vectorization, offline indexing, online inference, and evaluation methods.
CLIPHNSWLLM
0 likes · 13 min read

This article walks through the end‑to‑end process of building an image similarity solution—from vectorizing images with ResNet, storing high‑dimensional vectors in Milvus, using HNSW for fast ANN search, to applying YOLO for object detection and practical training tips.
Computer VisionHNSWMilvus
0 likes · 15 min read

The article explains how Redis vector search, powered by RedisSearch’s FLAT and HNSW algorithms and supporting various data types and precisions, enables fast AI-driven similarity queries for text, image, and audio, and provides implementation guidance, optimization tips, and a real‑world customer‑service use case.
AI applicationsHNSWHybrid Retrieval
0 likes · 17 min read

The article explains how Elasticsearch 8.16.1 stores dense and sparse vectors using various file extensions, compares flat and HNSW index formats, shows how disabling doc‑values removes redundant column‑store copies, and demonstrates scalar and binary quantization—including a quantization‑only mode—that can cut storage to roughly 9 percent while preserving search accuracy.
ElasticsearchHNSWIndex Optimization
0 likes · 32 min read

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.
ANNApproximate Nearest NeighborHNSW
0 likes · 25 min read

This article details Alibaba Cloud Elasticsearch's AI search advancements, covering embedding vectors, HNSW-based approximate nearest neighbor search, hardware-accelerated vector engines, sparse vectors, hybrid retrieval, the Inference API, and RAG implementations that together boost performance, efficiency, and relevance for modern AI-driven search applications.
ElasticsearchHNSWRAG
0 likes · 11 min read

This tutorial walks through building a Retrieval‑Augmented Generation application by setting up Baidu’s Vector Database and Qianfan embedding service, configuring credentials, creating a document database and vector table, loading and chunking PDFs, generating embeddings, storing them, and performing scalar, vector and hybrid similarity searches, ready for integration with Wenxin LLM for answer generation.
AI applicationsBaidu QianfanDocument Retrieval
0 likes · 11 min read

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.
AIANNEmbedding
0 likes · 27 min read

The article explains how vectors represent data in high‑dimensional space, describes the embedding process, outlines the evolution and challenges of vector search, compares exact and approximate algorithms such as IVF, product quantization and HNSW, and details Baidu’s cloud‑native engineering solutions for scalable, filtered vector retrieval.
AIApproximate Nearest NeighborEmbedding
0 likes · 14 min read

This article explains how Apache Solr implements neural search using dense vector fields, K‑Nearest Neighbor algorithms, and Hierarchical Navigable Small World graphs, detailing the underlying Lucene support, configuration options, query syntax, and integration with AI‑driven vector representations.
AIApache SolrDense Vectors
0 likes · 15 min read

Alibaba’s advertising pipeline progressed from low‑dimensional quantization partitions to hierarchical tree indexes, then to graph‑based HNSW structures—including multi‑category, multi‑level graphs and a BlazeOp‑driven scoring service—dramatically boosting recall efficiency, scalability and maintainability while meeting strict latency constraints.
HNSWRecallVector Search
0 likes · 13 min read

The article reviews how high‑dimensional vector representations in deep‑learning applications require efficient approximate nearest‑neighbor search, comparing K‑d trees, hierarchical k‑means trees, locality‑sensitive hashing, product quantization, and HNSW graphs, and discusses practical FAISS implementations and how algorithm choice depends on data size, recall, latency, and resources.
FaissHNSWKD-Tree
0 likes · 8 min read

This article explains how Apache Solr and Lucene implement neural search using dense vector fields, hierarchical navigable small‑world (HNSW) graphs, and approximate K‑nearest neighbor algorithms, covering configuration, custom codecs, indexing formats, and query parsers for vector‑based retrieval.
Apache SolrDense VectorsHNSW
0 likes · 15 min read

This article introduces the concept of vector retrieval, outlines its diverse application scenarios, explains common distance metrics for both floating‑point and binary vectors, and surveys fundamental approximate nearest‑neighbor algorithms including tree‑based, graph‑based, quantization, and hashing methods.
Approximate Nearest NeighborHNSWKD-Tree
0 likes · 22 min read

This article explains how deep learning transforms unstructured data into dense vectors, defines vector retrieval, outlines its many use cases such as product, video, and text search, discusses challenges in learning effective embeddings, and reviews high‑performance algorithms like LSH, neighbor graphs, and product quantization.
AI applicationsApproximate Nearest NeighborHNSW
0 likes · 21 min read

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.
ANNGNOIMIHNSW
0 likes · 16 min read
