1 रिपॉजिटरी
The process of building a searchable proximity graph, including configuring link density for recall and memory trade-offs.
Distinct from Index Construction: Specifically focuses on the construction of a vector proximity graph, distinct from general index initialization or knowledge graph indexing.
Explore 1 awesome GitHub repository matching data & databases · Graph. Refine with filters or upvote what's useful.
hnswlib is a header-only C++ library and vector indexing engine designed for high-dimensional approximate nearest neighbor search. It organizes large collections of embeddings into a searchable graph structure to enable rapid proximity queries and distance calculations. The system utilizes Hierarchical Navigable Small World graphs to achieve fast vector similarity search. It distinguishes itself by allowing the definition of custom distance metrics and similarity functions to adapt calculations to specific data requirements. The engine covers the full indexing lifecycle, including incrementa
Constructs hierarchical proximity graphs by configuring link density to balance memory usage and retrieval recall.