In this thesis a new implementation scheme of relational tables for multidimensional databases called HORT (History Offset implementation of Relational Tables) is presented based on multidimensional extendible arrays. Efficient storage schemes are required to store sparse data for multidimensional arrays. More over conventional schemes for storing multidimensional arrays do not support dynamic extension of an array and hence addition of a new column value is impossible if the size of the dimension overflows. In this thesis, these shortcomings are solved by an efficient scheme of record encoding based on the notion of extendible array.
展开▼
