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

    Voy

    A portable WebAssembly vector similarity search engine written in Rust with a tiny footprint (75KB gzipped). Designed for edge deployment, browsers, and IoT devices with support for k-d tree indexing and optimized for modern web applications.

    🌐Visit Website

    About this tool

    Overview

    Voy is a WASM vector similarity search engine written in Rust with an exceptionally small footprint of only 75KB gzipped (69KB brotli). It enables semantic search in browsers, edge environments, and IoT devices without requiring server-side infrastructure.

    Key Features

    • Tiny Footprint: Only 75KB gzipped, 69KB with brotli compression, reducing overhead for limited devices like mobile browsers and IoT
    • Fast: Optimized for creating the best search experience with efficient k-d tree indexing
    • Tree Shakable: Optimizes bundle size and enables asynchronous capabilities for modern Web APIs like Web Workers
    • Resumable: Generate portable embeddings index anywhere, anytime
    • Worldwide: Designed to deploy and run on CDN edge servers
    • Browser Support: Runs in non-Node environments including all modern browsers

    Technical Implementation

    • Data Structure: Uses k-d tree (k-dimensional tree) to organize and store embeddings
    • Distance Metric: Internally uses Squared Euclidean distance to calculate nearest neighbors
    • WASM: Compiled to WebAssembly from Rust for portability and performance

    Design Principles

    Voy follows several core design principles:

    1. Minimize size for limited devices (mobile browsers, IoT)
    2. Optimize for fast search performance
    3. Enable tree shaking for bundle optimization
    4. Support modern Web APIs like Web Workers
    5. Create portable, resumable indexes
    6. Enable edge deployment on CDNs

    Integration

    • LangChain.js: Voy can be used as a vector store with LangChain.js
    • npm Package: Available as voy-search on npm
    • Installation: Can be installed via npm, Yarn, or pnpm

    Simple Interface

    Voy provides a straightforward API with just two main operations:

    1. Index construction
    2. Querying an index for nearest neighbors

    Development Status

    Voy is under active development. The API is not yet stable, and there may be breaking changes before the 1.0 release.

    Use Cases

    • Client-side semantic search in web applications
    • Edge computing vector search
    • Mobile browser search functionality
    • IoT device similarity search
    • Offline-first applications
    • CDN-deployed search services

    Resources

    • GitHub: https://github.com/tantaraio/voy
    • npm: voy-search package
    • Language: Rust (compiled to WASM)
    Surveys

    Loading more......

    Information

    Websitegithub.com
    PublishedMar 17, 2026

    Categories

    1 Item
    Sdks & Libraries

    Tags

    3 Items
    #Wasm#Rust#Browser

    Similar Products

    6 result(s)
    Hannoy

    Graph-based approximate nearest neighbor search library built on LMDB key-value storage. The successor to Arroy, Hannoy combines graph-based ANN algorithms with production-ready persistent storage for vector databases.

    EntityDB

    A powerful, lightweight in-browser vector database that wraps IndexedDB and Transformers.js over WebAssembly, enabling semantic search and AI memory entirely in the browser without server requirements.

    MeMemo

    A JavaScript library that brings vector search and RAG (Retrieval-Augmented Generation) to browser environments, enabling efficient searching through millions of vectors using HNSW algorithm with IndexedDB and Web Workers.

    hnswlib-rs

    Pure-Rust implementation of HNSW algorithm for approximate nearest neighbor search. Decouples graph from vector storage for flexible deployment. Supports dense floating point and quantized int8 vectors. This is an OSS library.

    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.

    hora

    Hora is an efficient, open-source library for approximate nearest neighbor search, written in Rust. It offers high-performance vector search capabilities for AI and machine learning applications.

    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