Unverified50% confidenceFactExact time
LSA maps keys into a latent space and groups them layer by layer in a tree structure; a query starts at the root node, scores only a small number of candidate clusters at each layer and selects several branches to descend, finally reaching the subset of keys corresponding to leaf nodes, reducing the number of scoring operations from O(n) to on the order of O(log n).
1
Sources
50%
Confidence
Long-term
Relevance
11/2/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedAn interval tree is an augmented balanced binary search tree keyed by intervals, supporting the query "all intervals overlapping a given interval" in O(log n + k) time.71% similarUnverifiedGIN（广义倒排索引）对 tsvector 列建立索引后，每个词素映射到包含它的行集合，实现 O(log n) 的字段级查询70% similarUnverifiedIn a B+ tree, all actual data is stored in leaf nodes, internal nodes store only routing keys, and leaf nodes are linked together through pointers into an ordered linked list, supporting efficient range queries.67% similarUnverifiedPrim算法从任意节点出发逐步将最小权重边纳入生成树，配合优先队列可达O(E log V)67% similarUnverifiedBinary search locates an element in a sorted array in only O(log n) comparisons, and the search and insertion operations of a balanced binary search tree also have O(log n) time complexity.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1126137API
curl https://kongchang.com/api/v1/knowledge/claims/1126137MCP
get_claim(id=1126137)