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

06/13/2021
by   Alberto Boffi, et al.
0

This paper describes the most efficient way to manage operations on ranges 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 a high-impact operation in practical applications, performed by introducing a new data structure called Wise Red-Black Tree, an augmented version of the Red-Black Tree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2018

Red-Black Trees with Constant Update Time

We show how a few modifications to the red-black trees allow for O(1) wo...
research
12/24/2019

Flat combined Red Black Trees

Flat combining is a concurrency threaded technique whereby one thread pe...
research
02/22/2021

ikd-Tree: An Incremental K-D Tree for Robotic Applications

This paper proposes an efficient data structure, ikd-Tree, for dynamic s...
research
09/20/2023

A Verified Cost Analysis of Joinable Red-Black Trees

Ordered sequences of data, specified with a join operation to combine se...
research
07/10/2018

Monotonous betting strategies in warped casinos

Suppose that the outcomes of a roulette table are not entirely random, i...
research
04/09/2020

A Pedagogically Sound yet Efficient Deletion algorithm for Red-Black Trees: The Parity-Seeking Delete Algorithm

Red-black (RB) trees are one of the most efficient variants of balanced ...
research
11/21/2017

The Hidden Binary Search Tree:A Balanced Rotation-Free Search Tree in the AVL RAM Model

In this paper we generalize the definition of "Search Trees" (ST) to ena...

Please sign up or login with your details

Forgot password? Click here to reset