# GINGER: Spicing Up Graph-Based Vector Search

DevFeed: [GINGER: Spicing Up Graph-Based Vector Search](<https://devfeed.tech/articles/ginger-spicing-up-graph-based-vector-search-121278.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.08306>)

Author: Daniel Salwasser, Lars Gottesb\\"uren, Laxman Dhulipala, Jakub {\\L}\\k{a}cki, Guy Blelloch, Rajesh Jayaram, Tobias Rubel, Kshiteej Sheth, Amir Zandieh, Vahab Mirrokni

Published: 2026-11-06T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [ann](<https://devfeed.tech/topics/ann.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [quantization](<https://devfeed.tech/topics/quantization.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [approximate-nearest-neighbor-search](<https://devfeed.tech/tags/approximate-nearest-neighbor-search.md>), [c-plus-plus](<https://devfeed.tech/tags/c-plus-plus.md>), [codec](<https://devfeed.tech/tags/codec.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [graph](<https://devfeed.tech/tags/graph.md>), [indexing](<https://devfeed.tech/tags/indexing.md>), [memory](<https://devfeed.tech/tags/memory.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [quantization](<https://devfeed.tech/tags/quantization.md>), [recall](<https://devfeed.tech/tags/recall.md>), [search](<https://devfeed.tech/tags/search.md>), [throughput](<https://devfeed.tech/tags/throughput.md>), [vector-search](<https://devfeed.tech/tags/vector-search.md>)

## AI overview

Ginger is an open-source C++ library for graph-based approximate nearest neighbor search, designed to improve query throughput and indexing speed while keeping memory use comparable to the most space-efficient competitors. Its Nested TurboQuant quantizer uses low precision for graph navigation and higher precision for reranking, reportedly approaching floating-point precision with 2.6x less memory. The paper also reports graph compression of up to 2.5x without reducing query throughput, using graph reordering and the lossless AdaptiveGap codec built on StreamVByte. At 95% recall, Ginger achieves 1.8x average throughput over each dataset's fastest competitor and at least 2.3x over any single library; the reported advantage reaches 2.9x over compact libraries on high-dimensional embeddings.

## Source excerpt

arXiv:2611.08306v1 Announce Type: cross Abstract: We present \textsc{Ginger}, a state-of-the-art open-source C++ library for graph-based approximate nearest neighbor search (ANNS). We developed \textsc{Ginger} at Google to push the speed and memory efficiency of graph search on large and high-dimensional embedding datasets. \textsc{Ginger} surpasses existing ANNS libraries with regards to query throughput and indexing time while matching the memory footprint of the most space-efficient competitors. \textsc{Ginger} builds upon recent advances in proximity graph construction (PiPNN) and vector quantization (TurboQuant). We introduce Nested TurboQuant (NTQ), a two-level quantizer which supports low precision graph navigation and high precision reranking in a single code. This representation achieves near floating point precision with $2.6\times$ less memory. We also compress the size of our proximity graphs by up to $2.5\times$ without impacting query throughput. We combine graph reordering with a new lossless compression codec called AdaptiveGap, which builds upon StreamVByte. At $95\%$ recall, \textsc{Ginger} speeds up query throughput by an average of $1.8\times$ over each dataset's fastest competitor and by at least $2.3\times$ over any single library. This lead grows to $2.9\times$ over compact libraries on high-dimensional embeddings.