Tiered Cache-HNSW: Using Hierarchical Caching System in HNSW

With the progress in generative AI technology, systems such as RAG (Retrieval-Augmented Generation) are increasingly used. In these systems, graph-based Approximate Nearest Neighbor Search (ANNS) is commonly used for background information retrieval. However, as the size of the dataset increases, the search speed becomes significantly slower. In this paper, we propose Tiered Cache-HNSW (TC-HNSW) that caches pre-categorized datasets in layers. TC- HNSW prioritizes caching frequently accessed nodes into faster storage based on the number of accesses and their category, allowing faster searches. This paper describes TC- HNSW system design, caching strategy, and the efficiency of categorization-based caching. Our preliminary evaluation shows that categorization-based caching improves performance, achieving search speeds four times faster than traditional methods when search topics are specified.

Authors

Institutions

Publication Details

Published
2025-03-29
DOI
https://doi.org/10.1109/icct-pacific63901.2025.11012786
Citations
1
Primary Topic
Context-Aware Activity Recognition Systems
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tiered Cache-HNSW: Using Hierarchical Caching System in HNSW

Hitoshi Kamei, Kazuaki Ando, Kazuma Iwamoto, Rei Masuda
1 citations
Context-Aware Activity Recognition Systems
1.28
article

Tiered Cache-HNSW: Using Hierarchical Caching System in HNSW

Hitoshi Kamei, Kazuaki Ando, Kazuma Iwamoto, Rei Masuda
article en
1 citations

Abstract

With the progress in generative AI technology, systems such as RAG (Retrieval-Augmented Generation) are increasingly used. In these systems, graph-based Approximate Nearest Neighbor Search (ANNS) is commonly used for background information retrieval. However, as the size of the dataset increases, the search speed becomes significantly slower. In this paper, we propose Tiered Cache-HNSW (TC-HNSW) that caches pre-categorized datasets in layers. TC- HNSW prioritizes caching frequently accessed nodes into faster storage based on the number of accesses and their category, allowing faster searches. This paper describes TC- HNSW system design, caching strategy, and the efficiency of categorization-based caching. Our preliminary evaluation shows that categorization-based caching improves performance, achieving search speeds four times faster than traditional methods when search topics are specified.

Kagawa University (JP), Takamatsu University (JP)
Openalex Percentile: Top 20%
Context-Aware Activity Recognition Systems
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.