Metraipolis › archive › dc_65c92dbd522c

GINGER: Spicing Up Graph-Based Vector Search — arXiv:2611.08306

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08306
License (as archived)
CC0-1.0
Archived
2026-11-06T14:43:31.982Z
SHA-256 of the archived text
d1f924543b685c3a03fda78058df526e60c86a55efe1e04f201daa23f2858745
Stable URL of this page
https://metraipolis.com/documento/dc_65c92dbd522c

How to cite

GINGER: Spicing Up Graph-Based Vector Search — arXiv:2611.08306 — arXiv (en), https://arxiv.org/abs/2611.08306 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_65c92dbd522c (Metraipolis archive dc_65c92dbd522c, sha256 d1f924543b685c3a03fda78058df526e60c86a55efe1e04f201daa23f2858745)
BibTeX
@misc{dc65c92dbd522c,
  title = {GINGER: Spicing Up Graph-Based Vector Search — arXiv:2611.08306},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08306},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_65c92dbd522c; sha256 d1f924543b685c3a03fda78058df526e60c86a55efe1e04f201daa23f2858745},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08306. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Information Retrieval (cs.IR) ; Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2611.08306 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:19:12.623Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).