Efficient of bitmap join indexes for optimising star join queries in relational data warehouses
by Mohammed Yahyaoui; Souad Amjad; Lamia Benameur; Ismail Jellouli
International Journal of Computational Intelligence Studies (IJCISTUDIES), Vol. 9, No. 3, 2020

Abstract: Data warehouses are dedicated to analysis and decision-making applications. They are often schematised as star relational models or variants for on-line analysis. Typically, the analysis process is conducted via online analytical processing (OLAP) type queries. These queries are usually complex, characterised by multiple selections operations, joins, grouping and aggregations on large tables. Which require a lot of calculation time and thus a very high response time. The performance of these queries depends directly on the use of the secondary memory. Indeed, each input-output on disk requiring up to ten milliseconds. In order to reduce and minimise the cost of executing these queries, the data warehouse administrator must make a good physical design during the physical design and tuning phase by optimising access to the secondary memory. We focus on bitmap join indexes that share the same resource, that is, the selection attributes extracted from the business intelligence queries. To optimise star join queries.

Online publication date: Wed, 16-Sep-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Intelligence Studies (IJCISTUDIES):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com