Unverified50% confidenceFactExact time
A contiguous-memory double-ended queue (deque) grows from both ends toward the middle, maintaining one pointer or index at each end, and operations at both ends are O(1).
1
Sources
50%
Confidence
Long-term
Relevance
10/15/2026
First Seen
Sources
Related Entities
Related Claims
Unverified无索引邻接（Index-Free Adjacency）架构使每个节点直接持有指向相邻节点的物理内存指针，查询遍历时间复杂度为O(1)64% similarUnverified基于序列号的槽位机制中，环形缓冲区每个槽位携带独立序列号，将全局头尾指针写争用分散至各槽位，减少缓存行冲突62% 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.61% similarUnverifiedSuccinct data structures encode tree structure using bit vectors; the most classic encoding method is LOUDS (Level-Order Unary Degree Sequence), which performs tree navigation using two O(1)-implementable primitive operations: rank and select.59% similarUnverifiedWhen the data types on both sides of a WHERE condition or JOIN do not match, implicit type conversion occurs, causing index invalidation and full table scans, degrading query complexity from O(log n) to O(n).58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1037298API
curl https://kongchang.com/api/v1/knowledge/claims/1037298MCP
get_claim(id=1037298)