Abstract

Discrete Interval Encoding Trees (Diets) are data structures for the representation of fat, i.e. densely populated sets over a discrete linear order. In this paper we introduce algorithms for set-theoretic operations like intersection, union, etc. on sets represented as balanced diets. We empirically analyse their performance and show that these algorithms can outperform previouslyknownalgorithms onsetsliketheonesimplemented

Citations