• Home
  • Categories
  • Tags
  • Pricing
  • Submit
    Decorative pattern
    1. Home
    2. Sdks & Libraries
    3. NearestNeighbors.jl

    NearestNeighbors.jl

    NearestNeighbors.jl is a Julia package implementing various nearest neighbor search algorithms and index structures for high-dimensional vector data.

    🌐Visit Website

    About this tool

    NearestNeighbors.jl

    Category: SDKs & Libraries
    Tags: ann, julia, vector-search
    Source: https://github.com/KristofferC/NearestNeighbors.jl

    Description

    NearestNeighbors.jl is a Julia package providing high-performance nearest neighbor data structures and algorithms for high-dimensional vector data, including KDTree and BallTree implementations.

    Features

    • High-performance nearest neighbor search for vector data
    • Support for high-dimensional spaces
    • KDTree index structure
    • BallTree index structure
    • Implementations of nearest neighbor search algorithms built on these trees
    • Example scripts and usage patterns (via examples/ directory)
    • Benchmarking setup for performance evaluation (via benchmark/ directory)
    • Test suite for reliability and correctness (via test/ directory)

    Technical Details

    • Implemented in Julia
    • Distributed as a Julia package (Project.toml based)
    • Open-source with a LICENSE file included in the repository

    Pricing

    • Not specified; the project is open-source on GitHub (license details are in LICENSE.md).
    Surveys

    Loading more......

    Information

    Websitegithub.com
    PublishedDec 25, 2025

    Categories

    1 Item
    Sdks & Libraries

    Tags

    3 Items
    #Ann#Julia#Vector Search

    Similar Products

    6 result(s)
    AHPQ.jl

    AHPQ.jl is a Julia library providing training and inference for anisotropic hierarchical product quantization, compatible with ScaNN-style vector quantization and useful for building high-performance vector search pipelines.

    HNSW (Go)

    A Go implementation of the HNSW approximate nearest neighbor search algorithm, enabling developers to embed efficient vector similarity search directly into Go services and custom vector database solutions.

    HNSW (Rust)

    A Rust implementation of the HNSW (Hierarchical Navigable Small World) approximate nearest neighbor search algorithm, useful for building high-performance, memory-safe vector search components in Rust-based AI and retrieval systems.

    jvector

    jvector is a high-performance Java-based library and engine for vector search and approximate nearest neighbor indexing.

    Amazon OpenSearch k-NN

    Amazon OpenSearch's k-NN plugin enables scalable, efficient vector search using ANN algorithms (IVF, HNSW) directly within a managed OpenSearch cluster. It is directly relevant for building, querying, and scaling vector databases on AWS.

    Annoy

    An open-source library for approximate nearest neighbor search in high-dimensional spaces, often used as a backend for vector databases and search engines.

    Decorative pattern
    Built with
    Ever Works
    Ever Works

    Connect with us

    Stay Updated

    Get the latest updates and exclusive content delivered to your inbox.

    Product

    • Categories
    • Tags
    • Pricing
    • Help

    Clients

    • Sign In
    • Register
    • Forgot password?

    Company

    • About Us
    • Admin
    • Sitemap

    Resources

    • Blog
    • Submit
    • API Documentation
    All product names, logos, and brands are the property of their respective owners. All company, product, and service names used in this repository, related repositories, and associated websites are for identification purposes only. The use of these names, logos, and brands does not imply endorsement, affiliation, or sponsorship. This directory may include content generated by artificial intelligence.
    Copyright © 2025 Awesome Vector Databases. All rights reserved.·Terms of Service·Privacy Policy·Cookies