DeepAI AI Chat
Log In Sign Up

Zipping Segment Trees

by   Lukas Barth, et al.

Stabbing queries in sets of intervals are usually answered using segment trees. A dynamic variant of segment trees has been presented by van Kreveld and Overmars, which uses red-black trees to do rebalancing operations. This paper presents zipping segment trees - dynamic segment trees based on zip trees, which were recently introduced by Tarjan et al. To facilitate zipping segment trees, we show how to uphold certain segment tree properties during the operations of a zip tree. We present an in-depth experimental evaluation and comparison of dynamic segment trees based on red-black trees, weight-balanced trees and several variants of the novel zipping segment trees. Our results indicate that zipping segment trees perform better than rotation-based alternatives.


page 1

page 2

page 3

page 4


Flat combined Red Black Trees

Flat combining is a concurrency threaded technique whereby one thread pe...

A Simple and Space Efficient Segment Tree Implementation

The segment tree is an extremely versatile data structure. In this paper...

Engineering Top-Down Weight-Balanced Trees

Weight-balanced trees are a popular form of self-balancing binary search...

A Flexible Pipeline for the Optimization of CSG Trees

CSG trees are an intuitive, yet powerful technique for the representatio...

About Fibonacci trees III: multiple Fibonacci trees

In this third paper, we revisit the question to which extent the propert...