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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Anbar
2008-04-01
|
| Series: | مجلة جامعة الانبار للعلوم الصرفة |
| Subjects: | |
| Online Access: | https://juaps.uoanbar.edu.iq/article_15456_ae2e6d8d0dd820965fb9379ed9f9c1d5.pdf |
| Summary: | 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 |
|---|---|
| ISSN: | 1991-8941 2706-6703 |