AVL Trees with Relaxed Balance
نویسنده
چکیده
The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request processing in main-memory databases. In this paper, we describe a relaxed version of AVL trees. We prove that each update gives rise to at most a logarithmic number of rebalancing operations and that the number of rebalancing operations in the semidynamic case is amortized constant. 2000 Academic Press
منابع مشابه
Relaxed Balance through Standard Rotations
We consider binary search trees, where rebalancing transformations need not be connected with updates but may be delayed. For standard AVL tree rebalancing, we prove that even though the rebalancing operations are un-coupled from updates, their total number is bounded by O(M log(M +N)), where M is the number of updates to an AVL tree of initial size N. Hence, relaxed balancing of AVL trees come...
متن کاملOn Updating and Balancing Relaxed Balanced Search Trees in Main Memory
In this thesis, various methods for maintaining balanced search trees in main memory are considered. The work concentrates on algorithms applying relaxed balancing in which updates and rebalancing are uncoupled from each other. A new relaxed balanced tree, the rank-valued tree, which is a relaxed version of symmetric binary B-trees, also known as red-black trees, is introduced and analyzed. Ran...
متن کاملThe Performance of Concurrent Red-Black Tree Algorithms
Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. The idea of relaxed balancing is to uncouple the rebalancing from the updating in order to speed up the update operations and to allow a high degree of concurrency. Many di erent relaxed balancing algorithms have been proposed, especially for red-black trees and AVL trees, but their performa...
متن کامل0 Rank - Balanced Trees
Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing after an insertion or deletion takes O(1) amortized time and O(1) rotations worst-case. But the design space of balanced trees has not been fully explored. We continue the exploration. Our contributions are three. We systematically study the...
متن کاملComplexity of Layered Binary Search Trees with Relaxed Balance
When search trees are made relaxed, balance constraints are weakened such that updates can be made without immediate rebalancing. This can lead to a speed-up in some circumstances. However, the weakened balance constraints also make it more challenging to prove complexity results for relaxed structures. In our opinion, one of the simplest and most intuitive presentations of balanced search tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 61 شماره
صفحات -
تاریخ انتشار 1994