Unverified60% confidenceFactExact time
The time complexity of a Trie prefix tree query is O(m), where m is the length of the query string, independent of the total amount of data.
2
Sources
60%
Confidence
Long-term
Relevance
9/9/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedBinary 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.70% similarUnverified树形结构如前缀树Trie、R树能以O(log n)复杂度实现按需检索68% similarUnverifiedWHERE id > maxId LIMIT N的游标分页方式（Keyset Pagination）利用主键索引的B+树有序性，时间复杂度始终为O(log N + M)66% similarUnverified非原生图数据库需通过全局索引查找相邻节点，时间复杂度随图规模增长为O(log n)甚至O(n)65% similarUnverifiedThe computational complexity of cross-encoders is O(n²); document representations cannot be precomputed and scoring must be done online pair by pair, so cross-encoders are typically only used to rerank the top-k results returned by an initial retrieval stage.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/884459API
curl https://kongchang.com/api/v1/knowledge/claims/884459MCP
get_claim(id=884459)