Optimized Data Indexing Algorithms for OLAP Systems
Journal Title: Database Systems Journal - Year 2010, Vol 1, Issue 2
Abstract
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.
Authors and Affiliations
Lucian BORNAZ
Keywords
Related Articles
- EP ID EP119060
- DOI -
- Views 89
- Downloads 0
Integrated Information System for Higher Education Qualifications
In the present article we aim to study thoroughly and detail aspects related to architectures specific for e-learning and management of human resources training interconnected to management of qualifications. In addition...
Database Optimizing Services
Almost every organization has at its centre a database. The database provides support for conducting different activities, whether it is production, sales and marketing or internal operations. Every day, a database is ac...
Architecture of Automated Database Tuning Using SGA Parameters
Business Data always growth from kilo byte, mega byte, giga byte, tera byte, peta byte, and so far. There is no way to avoid this increasing rate of data till business still running. Because of this issue, database...
Optimization of Data Requests Timing by Working with Matrixes under MSAccess Environment
This paper is going to emphasize an optimised code in order to manage matrix calculus under MSAccess. The economic impact of using such a method is the optimal cost-benefit solution, and optimised timing for data managem...
Solutions for the Object-Relational Databases Design
The need for databases occurs in the moment when takes place an informatics system development. Moreover, databases are an important step in this process. For this reason, this paper deals with object-relational da...