Self-balancing binary search tree
Semantic Scholar uses AI to extract papers important to this topic.
Phase change memory (PCM) has become a promising candidate to replace DRAM in some massive/big data applications because of its… (More)
1 Max-Planck Institute for Informatics, Saarbrücken, Germany 66123. 2 Department of Computer Science, Saarland University, Saarbr… (More)
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on… (More)
In this paper we propose an online shape learning algorithm based on the self-balancing binary search tree data structure for the… (More)
I test the disposition effect, the tendency of investors to hold losing investments too long and sell winning investments too… (More)
Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the… (More)
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data… (More)
We use the idea of self-adjusting trees to create new, simple data structures for priority queues (which we call heaps) and… (More)
- ACM Trans. Database Syst.
Extendible hashing is a new access technique, in which the user is guaranteed no more than two page faults to locate the data… (More)
Binary search trees have received a great deal of attention in recent years. As a result of this interest, several methods have… (More)