Les index pour les entrep\^ots de donn\'ees : comparaison entre index arbre-B et Bitmap
El Amin Aoulad Abdelouarit (LSIT)

TL;DR
This paper compares B-tree and Bitmap indexes in data warehouses, demonstrating through experiments that Bitmap indexes are more advantageous for query performance.
Contribution
It provides a comparative analysis of B-tree and Bitmap indexes, highlighting the benefits of Bitmap indexes in data warehouse environments.
Findings
Bitmap indexes outperform B-tree indexes in the experiments.
Bitmap indexes are more suitable for data warehouses with large volumes of data.
The study offers practical insights for index selection in data warehouse design.
Abstract
With the development of decision systems and specially data warehouses, the visibility of the data warehouse design before its creation has become essential, and that because of data warehouse importance as considered as the unique data source giving meaning to the decision. In a decision system the proper functioning of a data warehouse resides in the smooth running of the middleware tools ETC step one hand, and the restitution step through the data mining, reporting solutions, dashboards... etc other. The large volume of data that passes through these stages require an optimal design for a highly efficient decision system, without disregarding the choice of technologies that are introduced for the data warehouse implementation such as: database management system, the type of server operating systems, physical server architecture (64-bit, for example) that can be a benefit performance…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Data Management and Algorithms · Data Mining Algorithms and Applications
