DBAIIRApr 8, 2025

MicroNN: An On-device Disk-resident Updatable Vector Database

arXiv:2504.05573v19 citationsh-index: 20Has CodeSIGMOD Conference Companion
Originality Synthesis-oriented
AI Analysis

It addresses the need for scalable, disk-efficient vector search on constrained devices, enabling real-world applications like RAG and content ranking with updates and filters, though it is incremental by adapting existing methods to new constraints.

The paper tackles the problem of efficient nearest neighbor search in low-resource, on-device environments with updatable vector collections and hybrid queries, achieving less than 7 ms retrieval time for top-100 neighbors with 90% recall on a million-scale benchmark using only ~10 MB of memory.

Nearest neighbour search over dense vector collections has important applications in information retrieval, retrieval augmented generation (RAG), and content ranking. Performing efficient search over large vector collections is a well studied problem with many existing approaches and open source implementations. However, most state-of-the-art systems are generally targeted towards scenarios using large servers with an abundance of memory, static vector collections that are not updatable, and nearest neighbour search in isolation of other search criteria. We present Micro Nearest Neighbour (MicroNN), an embedded nearest-neighbour vector search engine designed for scalable similarity search in low-resource environments. MicroNN addresses the problem of on-device vector search for real-world workloads containing updates and hybrid search queries that combine nearest neighbour search with structured attribute filters. In this scenario, memory is highly constrained and disk-efficient index structures and algorithms are required, as well as support for continuous inserts and deletes. MicroNN is an embeddable library that can scale to large vector collections with minimal resources. MicroNN is used in production and powers a wide range of vector search use-cases on-device. MicroNN takes less than 7 ms to retrieve the top-100 nearest neighbours with 90% recall on publicly available million-scale vector benchmark while using ~10 MB of memory.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes