Star Schema Advantages on Data Warehouse: Using Bitmap Index and Partitioned Fact Tables
Author(s) -
Emany Sidi,
Mohamed El,
El Amin
Publication year - 2016
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2016908108
Subject(s) - star schema , computer science , data warehouse , bitmap , schema (genetic algorithms) , index (typography) , information retrieval , database , data mining , world wide web , computer graphics (images) , database design , database schema
he data warehouse designer should consider it effectiveness while the design process, this might be a part of it work by analyzing the update frequency of production databases. Actually, to decide in a small time interval becomes the most important concern for deciders, this because it's always depending on data warehouse refresh using the ETLs and the cube generate process based on data warehouse schema type. To present the KPI's to the management quickly, we need to minimize the query execution time. This papers shows that the star schema is more advantageous when using a bitmap index based on ETL query execution time and data access time.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom