This paper describes the most efficient way to manage operations on groups of consecutive elements, or "blocks" of elements, within an ordered set. This will be done by introducing a new data structure called Wise Red-Black Trees, a variation of classical Red-Black Trees. The goal is to improve time complexity, while also keeping spatial complexity to a minimum. The optimization will be visible both at the asymptote and in terms of multiplicative constants, affecting not only the worst-case, but also the average one .
This paper describes the most efficient way to manage operations on groups of consecutive elements, or "blocks" of elements, within an ordered set. The goal is to improve existing solutions, by optimizing the average-case time complexity and getting rid of heavy multiplicative constants in the worst-case, without sacrificing space complexity. This is an high-impact operation in practical applications, and will be performed by introducing a new data structure called Wise Red-Black Tree, an augmented version of the Red-Black Tree .
R
This will be done
The goal is to improve existing solutions, by optimizing the average-case time complexity and getting rid of heavy multiplicative constants in the worst-case, without sacrificing space complexity. This is an high-impact operation in practical applications, and will be performed
R
Trees, a variation of classical
Tree, an augmented version of the
R
Trees. The goal is to improve time complexity, while also keeping spatial complexity to a minimum. The optimization will be visible both at the asymptote and in terms of multiplicative constants, affecting not only the worst-case, but also the average one
Tree