- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
BITMAP INDEX: A DATA STRUCTURE FOR FAST FILE RETRIEVAL | ||
| Journal of University of Anbar for Pure Science | ||
| Article 17, Volume 2, Issue 1, 2008, Pages 169-178 PDF (485.11 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.37652/juaps.2008.15456 | ||
| Author | ||
| Murtadha M. Hamad* | ||
| College of Computer-Al-Anbar University | ||
| Abstract | ||
| 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 | ||
| Keywords | ||
| Bitmap; indexes; tree; compressed keys; Retrieval Time | ||
|
Statistics Article View: 291 PDF Download: 198 |
||