RUS  ENG
Full version
JOURNALS // Preprints of the Keldysh Institute of Applied Mathematics // Archive

Keldysh Institute preprints, 2005 061 (Mi ipmp702)

Implementation of interactive data analyses basing on prefix tree data structure

A. V. Bondarenko, V. A. Galaktionov, V. I. Goremychkin, A. S. Gudkov, I. I. Strikovskii


Abstract: Accumulation of large amounts of data in organizations led to the need of creating new systems of extraction and analysis of information. OLAP, which is a technology of interactive data analysis on the basis of multidimensional logical model, became one of the most popular approaches. There were proposed many approaches to the realization of fast execution of OLAP queries: relational, multidimensional, index-based. Proposed in the work is the realization of OLAP in the form of prefix tree data structure and algorithm of tree reconstruction for query execution, which has high speed of query execution due to storing and processing of data in main memory and can process quite large amounts of data in comparison with other memory-based appro



© Steklov Math. Inst. of RAS, 2024