UB-Trees and UB-Cache A new Processing Paradigm for Database Systems
In this paper we describe a special caching technique, called UB-Cache, which is tailored to work with data organized as a UB-Tree, , a novel multidimensional datastructure. The UB-Cache makes it possible to read data from disk in arbitrary sort order according to those attributes that are used in the UB-Tree. This property can be used to speed up all operations of relational algebra substantially. We assume that the reader is familiar with the UB-Tree as described in  or .