Unverified50% confidenceFactExact time
局部敏感哈希LSH由Indyk和Motwani于1998年提出，可将billion级向量的最近邻搜索时间复杂度从O(n)降至近似O(1)
1
Sources
50%
Confidence
Long-term
Relevance
7/15/2026
First Seen
Sources
Related Claims
Unverified精确的 K 近邻搜索（KNN）时间复杂度为 O(n×d)，在数百万级别记忆条目下延迟不可接受，ANN 算法通过牺牲极小精度换取数量级速度提升70% similarUnverified局部敏感哈希（LSH）通过设计哈希函数使相似向量高概率映射到同一哈希桶，将最近邻搜索的时间复杂度从线性降至近似常数级65% similarUnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.62% similarVerifiedHNSW reduces search complexity to approximately O(log n) by constructing a multi-layer graph index, while IVF partitions the vector space via K-means clustering to achieve orders-of-magnitude speed improvements at the cost of approximately 5–10% recall.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/518304API
curl https://kongchang.com/api/v1/knowledge/claims/518304MCP
get_claim(id=518304)