An efficient way to manage blocks of data with Wise Red-Black Trees

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.