• Home
  • Categories
  • Tags
  • Pricing
  • Submit
  1. Home
  2. Open Sources
  3. nanopq

nanopq

nanopq is a lightweight product quantization library for efficient vector compression and similarity search, which is an important feature for vector databases that need to store and query large-scale vector data efficiently.

🌐Visit Website

About this tool

nanopq

Source Code

Description

nanopq is a lightweight library providing a pure Python implementation of Product Quantization (PQ) and Optimized Product Quantization (OPQ) for efficient vector compression and similarity search. It is designed for use cases that require handling large-scale vector data, such as vector databases and nearest neighbor search, and does not depend on any third-party libraries.

Features

  • Pure Python implementation (no third-party dependencies)
  • Implements both Product Quantization (PQ) and Optimized Product Quantization (OPQ)
  • Suitable for nearest neighbor search
  • Efficient vector compression for large-scale data
  • Compatible with Python 3.5+ on Linux
  • Easy installation via pip

Pricing

  • Open source and free to use (MIT License)

Tags

open-source, quantization, vector-compression, similarity-search

Surveys

Loading more......

Information

Websitegithub.com
PublishedJun 7, 2025

Categories

1 Item
Open Sources

Tags

4 Items
#open-source
#quantization
#vector compression
#similarity search

Similar Products

6 result(s)
Qinco

Qinco is an open-source implementation from Facebook Research for Residual Quantization with Implicit Neural Codebooks. It provides quantization and indexing methods for compact vector representations to accelerate similarity and nearest neighbor search, making it relevant as a low-level vector indexing and compression component for vector databases and large-scale AI retrieval systems.

arroy

Arroy is an open-source library for efficient similarity search and management of vector embeddings, useful in vector database systems.

Epsilla

Epsilla is an open-source vector database optimized for high-performance similarity search and scalable storage of vector embeddings.

HVS (Hierarchical Graph Structure)

HVS is a graph-based index structure leveraging Voronoi diagrams for approximate nearest neighbor search in high-dimensional vector spaces. It is directly relevant to vector databases as it provides efficient similarity search capabilities for large-scale vector data.

KGraph

KGraph is an open-source library for fast approximate nearest neighbor search in high-dimensional vector spaces, applicable to vector database solutions.

MuopDB

MuopDB is an open-source vector database designed for fast and scalable similarity search in AI applications.

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 Acme. All rights reserved.·Terms of Service·Privacy Policy·Cookies