Co-design of 14.5x compacted index, asynchronous scheduler, and multiplication-free kernel for PIM-based graph ANNS delivers up to 20x CPU and 17.1x GPU throughput on billion-scale benchmarks.
Similarity search in the blink of an eye with compressed indices,
2 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
2
Pith papers citing it
1
external citations · external index
years
2026 2verdicts
UNVERDICTED 2representative citing papers
AlayaLaser uses a SIMD-optimized on-disk graph layout plus caching and search strategies to outperform prior on-disk ANNS systems and match or exceed in-memory performance on large high-dimensional datasets.
citing papers explorer
-
Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory
Co-design of 14.5x compacted index, asynchronous scheduler, and multiplication-free kernel for PIM-based graph ANNS delivers up to 20x CPU and 17.1x GPU throughput on billion-scale benchmarks.
-
AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search
AlayaLaser uses a SIMD-optimized on-disk graph layout plus caching and search strategies to outperform prior on-disk ANNS systems and match or exceed in-memory performance on large high-dimensional datasets.