Unverified50% confidenceFactExact time
精确的 K 近邻搜索（KNN）时间复杂度为 O(n×d)，在数百万级别记忆条目下延迟不可接受，ANN 算法通过牺牲极小精度换取数量级速度提升
1
Sources
50%
Confidence
Long-term
Relevance
7/14/2026
First Seen
Sources
Adaptive Recall：基于MCP协议的AI助手持久记忆方案解析
Related Claims
Unverified局部敏感哈希LSH由Indyk和Motwani于1998年提出，可将billion级向量的最近邻搜索时间复杂度从O(n)降至近似O(1)70% 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.70% similarUnverified根据率失真理论，若序列包含O(N)比特相关信息而隐状态只有O(d)比特容量，当N远大于d时必然产生信息丢失70% similarUnverifiedThe self-attention mechanism resolves the vanishing gradient problem that RNN architectures face when processing long sequences and inherently supports large-scale parallel computation69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/503505API
curl https://kongchang.com/api/v1/knowledge/claims/503505MCP
get_claim(id=503505)