MicroNN: An On-device Disk-resident Updatable Vector Database
On the map: Retrieval-augmented generation → Vector search and ANN indexes
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in Vector search and ANN indexes, one of 15 directions in Retrieval-augmented generation. Builds on 19 of its 45 references that are in the map. First posted on arXiv 8 Apr 2025.
Builds on
19 of 45 references.
References · 19
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2018A Comprehensive Survey of Deep Learning for Image Captioningcited by 213
- 2020Deep Learning Based Text Classification: A Comprehensive Reviewcited by 140
- 2018Billion-scale Commodity Embedding for E-commerce Recommendation in Alibabacited by 105
- 2017Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graphcited by 103
- 2020PinnerSage: Multi-Modal User Embedding Framework for Recommendations at Pinterestcited by 75
- 2023Survey of Vector Database Management Systemscited by 38
- 2018Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighborscited by 37
- 2021FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Searchcited by 36
- 2024ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Datacited by 31
7 more
- 2024SPFresh: Incremental In-Place Update for Billion-Scale Vector Searchcited by 28
- 2017Related Pins at Pinterest: The Evolution of a Real-World Recommender Systemcited by 24
- 2018Applying Deep Learning To Airbnb Searchcited by 24
- 2024Results of the Big ANN: NeurIPS'23 competitioncited by 21
- 2023High-Throughput Vector Similarity Search in Knowledge Graphscited by 19
- 2018HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spacescited by 8
- 2023Binary Embedding-based Retrieval at Tencentcited by 6
Built on by
Citing papers per year: 2025: 2; 2026: 4.
6 papers.
- 2025Quake: Adaptive Indexing for Vector Searchcited by 8
- 2025Scalable Disk-Based Approximate Nearest Neighbor Search with Page-Aligned Graphcited by 2
- 2026A Super Fast K-means for Indexing Vector Embeddingscited by 2
- 2026Semantic Recall for Vector Searchcited by 0
- 2026Stop Indexing at Full Precision: Revisiting Clustering for Vector Embeddingscited by 0
- 2026Dynamic Flow, Static Graph: KV Cache Reuse for Efficient LLM Serving on Mobile NPUscited by 0
- 2026Dynamic Flow, Static Graph: KV Cache Reuse for Efficient LLM Serving on Mobile NPUs28 Sep 2026
- 2026Stop Indexing at Full Precision: Revisiting Clustering for Vector Embeddings30 Jul 2026
- 2026Semantic Recall for Vector Search22 Apr 2026
- 2026A Super Fast K-means for Indexing Vector Embeddings20 Mar 2026
- 2025Scalable Disk-Based Approximate Nearest Neighbor Search with Page-Aligned Graph29 Sep 2025
- 2025Quake: Adaptive Indexing for Vector Search3 Jun 2025
Similar, not cited
Close in wording, no citation either way
- 2026A Comprehensive Empirical Evaluation of Vector Database Systems for Approximate Nearest Neighbor Search: Performance, Quality, and Resource Trade-offs
- 2025Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN
- 2026Filtered Approximate Nearest Neighbor Search in Vector Databases: System Design and Performance Analysis
- 2025LEANN: A Low-Storage Vector Index
- 2025Cosmos: A CXL-Based Full In-Memory System for Approximate Nearest Neighbor Search
- 2026ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases ↗
- 2025HAKES: Scalable Vector Database for Embedding Search Service
- 2026HAVEN: High-Bandwidth Flash Augmented Vector Engine for Large-Scale Approximate Nearest-Neighbor Search Acceleration