CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Bitmap Index as Effective Indexing for Low Cardinality Column in Data Warehouse

by Zainab Qays Abdulhadi, Zhang Zuping, Hamed Ibrahim Housien
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 68 - Number 24
Year of Publication: 2013
Authors: Zainab Qays Abdulhadi, Zhang Zuping, Hamed Ibrahim Housien
10.5120/11730-7386

Zainab Qays Abdulhadi, Zhang Zuping, Hamed Ibrahim Housien . Bitmap Index as Effective Indexing for Low Cardinality Column in Data Warehouse. International Journal of Computer Applications. 68, 24 ( April 2013), 38-42. DOI=10.5120/11730-7386

@article{ 10.5120/11730-7386,
author = { Zainab Qays Abdulhadi, Zhang Zuping, Hamed Ibrahim Housien },
title = { Bitmap Index as Effective Indexing for Low Cardinality Column in Data Warehouse },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 68 },
number = { 24 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 38-42 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume68/number24/11730-7386/ },
doi = { 10.5120/11730-7386 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:28:49.784869+05:30
%A Zainab Qays Abdulhadi
%A Zhang Zuping
%A Hamed Ibrahim Housien
%T Bitmap Index as Effective Indexing for Low Cardinality Column in Data Warehouse
%J International Journal of Computer Applications
%@ 0975-8887
%V 68
%N 24
%P 38-42
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Speeding up query processing is a sensitive issue in the data warehouse. Using some mechanisms like summary tables and indexes can be a solution to this problem. However, though the performance when using summary tables for predefined queries is good but to save space and time during the query processing, indexing is a better solution without extra hardware. The challenge is to find a suitable index type that would enhance the query's performance. Some relational database management systems are carried out by new indexing techniques, such as bitmap indexing, to speed up processing. Bitmap indexes have a particular structure for a quick data retrieval. This paper focuses on measuring the performance of Bitmap as index in data warehouse comparing it with the B-tree index using oracle environment which uses B-Tree as default indexing technique to avoid the problem of( low cardinality column ) when an attribute has few values.

References
  1. Oracle® Database Administrator's Guide, "Managing Indexes", available at : http://docs. oracle. com/cd/B19306_01/server. 102/b14231/indexes. htm.
  2. ShawanaJamil?RashdaIbrahim ?"Performance Analysis of Indexing Techniques in Data Warehousing"?IEEE International Conference on Emerging Technologies?2009.
  3. SirirutVanichayobon, JarinManfuekphan?Le Gruenwald "Scatter Bitmap: Space-Time Efficient Bitmap Indexing for Equality and Membership Queries"?Conference IEEE?2006. .
  4. Sinha, R. R. ; Winslett, M. ; Kesheng Wu; Stockinger, K. ; Shoshani, A. ?" Adaptive Bitmap Indexes for Space-Constrained Systems" Data Engineering, 2008. ICDE . IEEE 24th International Conference on 2008
  5. Kesheng Wu; Koegler, W. ; Chen, J. ; Shoshani, A. " Using Bitmap Index for Interactive Exploration of Large Datasets",2003.
  6. Md. GolamRabilulAlam, Mohammed Yasir Arafat, Mohammed Kamal UddinIftekhar?"A New Approach of Dynamic Encoded Bitmap IndexingTechnique based on Query History"IEEE, 5th International Conference on Electrical and Computer Engineering?ICECE 2008
  7. He, Bin; Hsiao, Hui-I; Liu, Ziyang; Huang, Yu; Chen, Yi ," Efficient Iceberg Query Evaluation UsingCompressed Bitmap Index" IEEE JOURNALS & MAGAZINES,2012.
  8. WeahasonWeahama, SirirutVanichayobon and JarinManfuekphan ," Using Data Clustering to Optimize Scatter Bitmap Index ",,2009.
  9. Cormen T. H. , Leiserson C. E. , Rivest R. L. "Introduction to algorithms, McGraw-Hill ,2000
  10. sirirut Vanichayobon, Le Gruenwald, "Indexing Techniques for Data Warehouses Queries", The University of Oklahoma ,1999.
  11. Eduardo Gutarra Velez,"Multi-column Bitmap Indexing",Master Thesis of Computer Science (MCS)of Computer Science, EAFIT, 2009.
  12. Kurt Stockinger,Kesheng Wu,Arie Shoshani,"Strategies for Processing ad hoc Queries on Large DataWarehouses, .
  13. Kesheng Wu, Kurt Stockinger and ArieShoshani ,"Breaking the Curse of Cardinality on Bitmap Indexes" 2008.
  14. Wisegeek "What Is a Bitmap "Index", available at : http://www. wisegeek. com/what-is-a-bitmap-index. htm5
  15. StéphaneAzefack, KamelAouiche," Dynamic index selection in data warehouses "IEEE Conference ,2007.
  16. USAS, "annual datasets", available at : http://www. ucas. ac. uk/about_us/stat_services/stats_online/annual_datasets_to_download/.
Index Terms

Computer Science
Information Sciences

Keywords

Data warehouse Bitmap index B-Tree index indexing

Powered by PhDFocusTM