U-HNSW is the first graph-based index for approximate nearest neighbor search under all Lp metrics (0 < p <= 2) simultaneously, using L1/L2 HNSW graphs plus early-termination verification to beat MLSH query times.
http://phototour.cs.washington.edu/ patches/default.htm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
U-HNSW is the first graph-based index for approximate nearest neighbor search under all Lp metrics (0 < p <= 2) simultaneously, using L1/L2 HNSW graphs plus early-termination verification to beat MLSH query times.