BITMAP INDEX: A DATA STRUCTURE FOR FAST FILE RETRIEVAL
Bitmap structure indexes are usually used in database environments which have large amount of data. Bitmap reduces response time and storage requirements for large database compared to other data structures like B- tree. In this research , the Bitmap structure is studied and analyzed using Visual Fo...
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Artihkal |
| Giella: | English |
| Almmustuhtton: |
University of Anbar
2008-04-01
|
| Ráidu: | مجلة جامعة الانبار للعلوم الصرفة |
| Fáttát: | |
| Liŋkkat: | https://juaps.uoanbar.edu.iq/article_15456_ae2e6d8d0dd820965fb9379ed9f9c1d5.pdf |
| _version_ | 1827396409013305344 |
|---|---|
| author | Murtadha M. Hamad |
| author_facet | Murtadha M. Hamad |
| author_sort | Murtadha M. Hamad |
| collection | DOAJ |
| description | Bitmap structure indexes are usually used in database environments which have large amount of data. Bitmap reduces response time and storage requirements for large database compared to other data structures like B- tree. In this research , the Bitmap structure is studied and analyzed using Visual Foxpro-8 Software. .The empirical study proved the efficiency of this structure for compressing keys.A Comparison between this structure and B-tree was done as an example to explain more advantages for Bitmap structure |
| first_indexed | 2024-03-08T18:50:33Z |
| format | Article |
| id | doaj.art-f3001a65c44a4a6fa6ec783d9ba98934 |
| institution | Directory Open Access Journal |
| issn | 1991-8941 2706-6703 |
| language | English |
| last_indexed | 2024-03-08T18:50:33Z |
| publishDate | 2008-04-01 |
| publisher | University of Anbar |
| record_format | Article |
| series | مجلة جامعة الانبار للعلوم الصرفة |
| spelling | doaj.art-f3001a65c44a4a6fa6ec783d9ba989342023-12-28T21:52:24ZengUniversity of Anbarمجلة جامعة الانبار للعلوم الصرفة1991-89412706-67032008-04-012116917810.37652/juaps.2008.1545615456BITMAP INDEX: A DATA STRUCTURE FOR FAST FILE RETRIEVALMurtadha M. Hamad0College of Computer-Al-Anbar UniversityBitmap structure indexes are usually used in database environments which have large amount of data. Bitmap reduces response time and storage requirements for large database compared to other data structures like B- tree. In this research , the Bitmap structure is studied and analyzed using Visual Foxpro-8 Software. .The empirical study proved the efficiency of this structure for compressing keys.A Comparison between this structure and B-tree was done as an example to explain more advantages for Bitmap structurehttps://juaps.uoanbar.edu.iq/article_15456_ae2e6d8d0dd820965fb9379ed9f9c1d5.pdfbitmapindexestreecompressed keysretrieval time |
| spellingShingle | Murtadha M. Hamad BITMAP INDEX: A DATA STRUCTURE FOR FAST FILE RETRIEVAL مجلة جامعة الانبار للعلوم الصرفة bitmap indexes tree compressed keys retrieval time |
| title | BITMAP INDEX: A DATA STRUCTURE FOR FAST FILE RETRIEVAL |
| title_full | BITMAP INDEX: A DATA STRUCTURE FOR FAST FILE RETRIEVAL |
| title_fullStr | BITMAP INDEX: A DATA STRUCTURE FOR FAST FILE RETRIEVAL |
| title_full_unstemmed | BITMAP INDEX: A DATA STRUCTURE FOR FAST FILE RETRIEVAL |
| title_short | BITMAP INDEX: A DATA STRUCTURE FOR FAST FILE RETRIEVAL |
| title_sort | bitmap index a data structure for fast file retrieval |
| topic | bitmap indexes tree compressed keys retrieval time |
| url | https://juaps.uoanbar.edu.iq/article_15456_ae2e6d8d0dd820965fb9379ed9f9c1d5.pdf |
| work_keys_str_mv | AT murtadhamhamad bitmapindexadatastructureforfastfileretrieval |