벡터 데이터베이스

An embedding model maps an item such as a passage or image into a vector. The database indexes those vectors so a query representation can retrieve nearby items. Keep the original content, source identifier, and relevant metadata available with the vector. The embedding model and similarity measure must be compatible with the application. Changing the model can change the meaning or dimensions of stored representations. A migration may require recomputing embeddings and rebuilding an index rather than mixing old and new vectors. Exact nearest-neighbor search compares candidates directly, while approximate methods trade some retrieval fidelity for speed or memory efficiency. Evaluate the tradeoff using representative queries and the actual collection size. Database latency alone does not measure the relevance of the returned evidence. Plan updates, deletion, and authorization as part of the design. A removed document should not remain discoverable through an old embedding. Metadata filters need to enforce the requesting user’s permitted scope. Test concurrent updates and fallback behavior when the index is unavailable.