UB-Trees and UB-Cache A new Processing Paradigm for Database Systems

User: Guest

Title:: UB-Trees and UB-Cache A new Processing Paradigm for Database Systems
Document type:: Technical Report
Author(s):: Rudolf Bayer (FORWISS)
Abstract:: In this paper we describe a special caching technique, called UB-Cache, which is tailored to work with data organized as a UB-Tree[6], [7], 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 [6] or [7].
Keywords:: Datenbanken; Sortieralgorithmen; mehrdimensional; multidimensional; Zugriffsstruktur; Indexstruktur; Relationale Algebra; UB-Baum; UB-Cache; Datamining; Joins
Year:: 1997
Year / month:: 1997-03-01 00:00:00
Pages:: 15
BibTeX

Occurrences: