Unverified50% confidenceFactExact time
LSM-Tree was proposed by Patrick O'Neil et al. in 1996, originally to address the random I/O bottleneck of traditional B-trees under high write loads.
1
Sources
50%
Confidence
Long-term
Relevance
10/8/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedLSTM was proposed by Hochreiter and Schmidhuber in 1997, and its gating mechanism solved the vanishing gradient problem of standard RNNs.64% similarUnverifiedThe R-tree was proposed by Antonin Guttman in 1984 and is a balanced tree structure specifically designed for multi-dimensional spatial data, with a query time complexity of approximately O(log n).60% similarUnverified稀疏编码理论由Olshausen与Field于1996年提出56% similarUnverifiedLatent Semantic Analysis (LSA) was proposed by Deerwester et al. in 1990, obtaining low-dimensional representations by performing singular value decomposition on a co-occurrence matrix.53% similarUnverifiedThe Mersenne Twister algorithm was proposed by Makoto Matsumoto and Takuji Nishimura in 1997.51% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/986102API
curl https://kongchang.com/api/v1/knowledge/claims/986102MCP
get_claim(id=986102)