Tagged articles
similarity search
22 articles · Page 1 of 1
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 article walks through the complete workflow of turning split text into high‑dimensional vectors, choosing the right embedding model, selecting an appropriate similarity metric, comparing index structures such as Flat, IVF, HNSW and PQ, and finally picking a vector database and integrating it with LangChain.js for production‑grade RAG pipelines.
LangChainRAGembeddings
0 likes · 25 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 how embeddings turn text into high‑dimensional vectors, compares commercial and open‑source embedding models, details cosine, Euclidean and inner‑product similarity metrics, reviews common index structures such as Flat, IVF, HNSW and PQ, and shows how to choose and use a vector database with LangChain.js while avoiding typical pitfalls.
LangChainRAGembeddings
0 likes · 25 min read

This article explains what a vector database is, how it stores and retrieves high‑dimensional vector data, outlines its key characteristics and indexing mechanisms, compares it with traditional databases, and reviews common open‑source vector database solutions such as Milvus, Faiss, Weaviate, PgVector, Chroma, LanceDB, Elasticsearch and Qdrant.
AIEmbeddingindexing
0 likes · 14 min read

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.
AI applicationsANNMilvus
0 likes · 5 min read

Alibaba’s newly open‑sourced Zvec brings an in‑process vector database that claims millisecond searches over billions of vectors, supports dense and sparse embeddings, installs via a single pip command, and runs on anything from laptops to edge devices, though users warn of memory limits and unverified security concerns.
PythonRAGZvec
0 likes · 3 min read

This article explains why vector databases are essential for AI-driven unstructured data, surveys the current landscape of professional and extended vector databases, and provides a detailed technical comparison between Milvus and OceanBase, covering architecture, features, performance, and product positioning.
AIDatabase ArchitectureMilvus
0 likes · 11 min read


21CTOAug 17, 2024 · Artificial Intelligence
This guide explains the differences between vector stores and vector databases, covering vector embeddings, performance, scalability, integration, and ideal use‑cases, helping developers choose the right tool—or a hybrid approach—for AI applications.
AI embeddingsVector Storescalable architecture
0 likes · 12 min read

This article explains how vector databases store and query high‑dimensional embeddings, compares them with standalone vector indexes, outlines common embedding types and indexing algorithms, and discusses performance, monitoring, security, and API considerations for building robust AI‑driven systems.
AIANN searchindexing
0 likes · 22 min read

ChromaDB is an open‑source, AI‑native vector database that efficiently stores, indexes, and retrieves high‑dimensional embeddings, offering fast similarity search, easy integration via flexible APIs, strong scalability, and active community support, making it suitable for recommendation systems, NLP, and image‑recognition workloads.
AIChromaDBembeddings
0 likes · 5 min read

Vector retrieval, based on converting data into high‑dimensional vectors and measuring similarity, enables fast, accurate search across massive datasets, supporting AI tasks such as search engines, recommendation, NLP, and computer vision, and plays a crucial role in large‑model training for data selection, anomaly detection, and model optimization.
AI TrainingApproximate Nearest Neighborinformation retrieval
0 likes · 6 min read

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.
ANNdatabasesmachine learning
0 likes · 9 min read


ITPUBJul 5, 2023 · Databases
Vector databases enable efficient similarity search and storage of high‑dimensional embeddings, allowing enterprises to combine large language models with proprietary knowledge assets to create domain‑specific, accurate, and up‑to‑date AI services, as illustrated with open‑source solutions Chroma and Milvus.
AIChromaLLM
0 likes · 11 min read

This article explains what vectors and vector databases are, how they differ from traditional databases, their core technologies, their relationship with large language models, market trends, and details of Tencent Cloud VectorDB’s capabilities, architecture, real‑world applications, and future competitive challenges.
AIEmbeddingLLM
0 likes · 10 min read

Vector databases store and search large-scale vector data, and in 2023 the five leading solutions—Chroma, Pinecone, Weaviate, Milvus, and Faiss—offer scalable, high-performance options for applications such as LLM-driven services, audio search, recommendation systems, image/video analysis, and semantic retrieval across various industries.
AIData StorageLLM
0 likes · 4 min read

The article explains what vector databases are, how vectors and embeddings work, the main embedding methods such as matrix factorization, NLP and graph techniques, the characteristics and high‑availability requirements of vector databases, and common AI‑driven application scenarios like semantic search, recommendation and anomaly detection.
AIEmbeddingmachine learning
0 likes · 8 min read

This tutorial explains what Faiss is, how to install it, construct various indexes such as IndexFlatL2, IndexIVFFlat, and IndexIVFPQ, and demonstrates code examples for building and querying vector similarity search pipelines while discussing speed‑accuracy trade‑offs.
AIApproximate Nearest NeighborFaiss
0 likes · 11 min read

This article examines the challenges of performing time‑series similarity queries on massive datasets and presents three scalable solutions—partition‑based indexing, dimensionality‑reduction using MinHash, and a combined approach with Locality Sensitive Hashing—to reduce computation while preserving similarity accuracy.
LSHMinhashPartitioning
0 likes · 10 min read

This article introduces the background of vector representations in machine learning, explains the K‑Nearest Neighbors algorithm and its key parameters, reviews traditional tree‑based and modern high‑performance search solutions, and demonstrates how FAISS can achieve microsecond‑level KNN queries on large‑scale high‑dimensional data.
FaissKNNVector Search
0 likes · 5 min read

MSQL+ is a plugin toolkit that embeds similarity‑search capabilities directly into distributed relational databases such as Tencent’s TDSQL, using B‑tree indexes on generated signatures, customizable DIST functions, and various pivot‑selection strategies to enable scalable, SQL‑standard, approximate queries across sharded data.
MSQL+RDBMSTDSQL
0 likes · 12 min read
