Metraipolis › archive › dc_b4eb45edb717
A Versioned Unified Graph Index for Dynamic Timestamp-Aware Nearest Neighbor Search — arXiv:2608.27663
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.27663
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T11:28:12.926Z
- SHA-256 of the archived text
7302e10a31f61ba1ff9da946f70f494bc460fdbe5d0af8b1ff79aa7461734c9b- Stable URL of this page
https://metraipolis.com/documento/dc_b4eb45edb717
How to cite
A Versioned Unified Graph Index for Dynamic Timestamp-Aware Nearest Neighbor Search — arXiv:2608.27663 — arXiv (en), https://arxiv.org/abs/2608.27663 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b4eb45edb717 (Metraipolis archive dc_b4eb45edb717, sha256 7302e10a31f61ba1ff9da946f70f494bc460fdbe5d0af8b1ff79aa7461734c9b)
BibTeX
@misc{dcb4eb45edb717,
title = {A Versioned Unified Graph Index for Dynamic Timestamp-Aware Nearest Neighbor Search — arXiv:2608.27663},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.27663},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b4eb45edb717; sha256 7302e10a31f61ba1ff9da946f70f494bc460fdbe5d0af8b1ff79aa7461734c9b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27663. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present TiGER (Time-Integrated Graph for Efficient Retrieval), a novel approach for performing fast time-aware approximate nearest neighbor searches on dynamic vector datasets with flexibility over any possible time range. Our proposed algorithm builds and maintains a unified graph for all vectors by leveraging an index structure based on integrated versioned connectivity, allowing arbitrary time intervals to be queried directly on the unified graph without having to traverse invalid vectors. This forgoes the need for post-search filtering or merging, or separate graphs for each possible composite range. Empirical evaluations show that our method attains up to a 5x improvement in queries per second (QPS) without compromising accuracy over baselines based on filtering or per-time-segment sub-graphs. We believe that this method will enable efficient temporal analysis across evolving datasets in real-time recommendation systems, log analysis, and any scenario requiring fast similarity search over dynamic, time-segmented data. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-31 in cs.IR). Categorie arXiv: Information Retrieval (cs.IR). Pagina del lavoro: https://arxiv.org/abs/2608.27663 — 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-10-17T11:09:46.445Z dalla pagina https://arxiv.org/catchup/cs.IR/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).