Optimized Data Indexing Algorithms for OLAP Systems
The need to process and analyze large data volumes, as well as to convey the information contained therein to decision makers naturally led to the development of OLAP systems. Similarly to SGBDs, OLAP systems must ensure optimum access to the storage environment. Although there are several ways to optimize database systems, implementing a correct data indexing solution is the most effective and less costly. Thus, OLAP uses indexing algorithms for relational data and n-dimensional summarized data stored in cubes. Today database systems implement derived indexing algorithms based on well-known Tree, Bitmap and Hash indexing algorithms. This is because no indexing algorithm provides the best performance for any particular situation (type, structure, data volume, application). This paper presents a new n-dimensional cube indexing algorithm, derived from the well known B-Tree index, which indexes data stored in data warehouses taking in consideration their multi-dimensional nature and provides better performance in comparison to the already implemented Tree-like index types.
Year of publication: |
2010
|
---|---|
Authors: | BORNAZ, Lucian |
Published in: |
Database Systems Journal. - Academia de Studii Economice din Bucureşti, ISSN 2069-3230. - Vol. 1.2010, 2, p. 17-26
|
Publisher: |
Academia de Studii Economice din Bucureşti |
Subject: | data warehouse | indexing algorithm | OLAP | n-Tree |
Saved in:
freely available
Saved in favorites
Similar items by subject
-
Approaches and issues in view selection for materialising in data warehouse
Goswami, Rajib, (2016)
-
Kašćelan, Ljiljana, (2011)
-
Dynamic cubing for hierarchical multidimensional data space
Ahmed, Usman, (2014)
- More ...