Self-adjusting binary search trees
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations
SIAM Journal on Computing
Deterministic optimal and expedient move-to-rear list organizing strategies
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Self-Organizing Binary Search Trees
Journal of the ACM (JACM)
Balancing binary trees by internal path reduction
Communications of the ACM
On self-organizing sequential search heuristics
Communications of the ACM
A Relationship Between Self-Organizing Lists and Binary Search Trees
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
On Using Adaptive Binary Search Trees to Enhance Self Organizing Maps
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
PReMI'11 Proceedings of the 4th international conference on Pattern recognition and machine intelligence
Efficient adaptive data compression using fano binary search trees
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
| Hi-index | 0.00 |
Consider a set A=(A_1,A_2,..., A_n) of records, where each record is identified by a unique key. The records are accessed based on a set of access probabilities S=(s_1,s_2,..., s_n) and are to be arranged lexicographically using a binary search tree (BST). If S is known a priori, it is well known that an optimal BST may be constructed using A and S. The case when S is not known a priori is considered. A new restructuring heuristic is introduced that requires three extra integer memory locations per record. In this scheme, the restructuring is performed only if it decreases the weighted path length (WPL) of the overall resultant tree. An optimized version of the latter method, which requires only one extra integer field per record has, is presented. Initial simulation results comparing this algorithm with various other static and dynamic schemes indicates that this scheme asymptotically produces trees which are an order of magnitude closer to the optimal one than those produced by many of the other BST schemes reported in the literature.