Abstract
We introduce a new data structure, the k-forest, which is a self-adjusting multi-way search tree. A k-forest provides an efficient implementation of a weighted Dictionary in a virtual memory environment where the time to access a tree node is much greater than the time to examine data itmes in a node. We achieve results that are natural generalizations of the Working Set and Static Optimality theorems of Sleator and Tarjan for splay trees. Thus we are able to show that even when the lookup frequencies of the elements of the dictionary are not known in advance, a k-forest can equal or exceed the performance of an optimal static multi-way tree which is built knowing the lookup frequencies in advance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
