PiPNN builds high-quality approximate-nearest-neighbor search graphs up to 12.9x faster than HNSW and 11.6x faster than Vamana by replacing search-based construction with overlapping partitions, dense GEMM distance computations, and an LSH-based online pruning rule.
Title resolution pending
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
fields
cs.DB 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing
PiPNN builds high-quality approximate-nearest-neighbor search graphs up to 12.9x faster than HNSW and 11.6x faster than Vamana by replacing search-based construction with overlapping partitions, dense GEMM distance computations, and an LSH-based online pruning rule.