Abstract: The invention concerns a database system and method of organizing a multidimensional data stock. The database system comprises a computing arrangement, a main memory and an in particular peripheral memory arrangement. In order to index and store the data stock present in multidimensional cube on memory pages of the peripheral memory device with a given storage capacity, the multidimensional cube is divided iteratively in all dimensions into sub-cubes until successive sub-cubes can be combined to form regions each containing an amount of data objects which can be stored on one of the memory pages with a given storage capacity. The method according to the invention for organizing, insert, deleting and searching for data objects is designed as a dynamic data structure known as an “FB tree”, which improves access times and is therefore suitable for use in on-line applications.

Abstract: The invention concerns a database system and method of organizing a multidimensional data stock. The database system comprises a computing arrangement, a main memory and an in particular peripheral memory arrangement. In order to index and store the data stock present in multidimensional cube on memory pages of the peripheral memory device with a given storage capacity, the multidimensional cube is divided iteratively in all dimensions into sub-cubes until successive sub-cubes can be combined to form regions each containing an amount of data objects which can be stored on one of the memory pages with a given storage capacity. The method according to the invention for organizing, insert, deleting and searching for data objects is designed as a dynamic data structure known as an “FB tree”, which improves access times and is therefore suitable for use in on-line applications.

Abstract: The invention relates to a database system comprising a computing unit, a main memory and a, in particular a peripheral memory storing at least one multi-dimensional stock of data in the form of a UB tree, further the invention relates to methods to run a database of this kind to read data and to implement join operations and further relational algebra operations, and sub-dividing the UB tree into a predetermined number of sub-spaces and consecutively processing the sub-spaces to read and ready the stock of data. Advantageously a cache storage buffers the regions (jump regions) of the UB tree cutting the sub-space being processed until the jump region(s) has (have) been completely processed in the subsequent sub-spaces.

Abstract: An epitaxial growth chamber with a quartz dome that can withstand low pressure forces and also allows laminar flow in atmospheric pressure processes.