scholarly journals Compressed bitmap indexes: beyond unions and intersections

2014 ◽  
Vol 46 (2) ◽  
pp. 167-198 ◽  
Author(s):  
Owen Kaser ◽  
Daniel Lemire
Keyword(s):  
Bitmap Indexes

scholarly journals Optimizing Range Query Processing for Dual Bitmap Index

2018 ◽  
Vol 16 (2) ◽  
pp. 133-142
Author(s):  
Naphat KEAWPIBAL ◽  
Ladda PREECHAVEERAKUL ◽  
Sirirut VANICHAYOBON
Keyword(s):  
Query Processing ◽  
Range Query ◽  
Range Queries ◽  
Boolean Operations ◽  
Bitmap Index ◽  
Indexing Method ◽  
Overall Performance ◽  
Optimizing Algorithm ◽  
Bitmap Indexes ◽  
Range Query Processing

Bitmap-based indexes are known to be the most effective indexing method for retrieving and answering selective queries in a read-only environment. Various types of encoding bitmap indexes significantly improve query time efficiency by utilizing fast Boolean operations directly on the index before retrieving the raw data. In particular, the dual bitmap index improves the performance of equality queries in terms of the space vs. time trade-off. However, the performance of range queries is unsatisfactory. In this paper, an optimizing algorithm is proposed to improve the range query processing for the dual bitmap index. The results of the experiment conducted show that the proposed algorithm, called Dual-simRQ, reduces the number of bitmap vectors scanned and the Boolean operations performed, which impacts the overall performance for range query processing.

scholarly journals An Improved Framework for Bitmap Indexes and their Use in Data Warehouse Optimization

2021 ◽  
Vol 12 (2) ◽  
pp. 1513-1520
Author(s):  
Dr. J. Preetha, Et. al.
Keyword(s):  
Data Warehouse ◽  
Bitmap Index ◽  
Compression Technique ◽  
Data Manipulation ◽  
Disk Space ◽  
Index Compression ◽  
Storage Area ◽  
Table Data ◽  
Manipulation Language ◽  
Bitmap Indexes

Compression technique is basically used to compress the size of table or reduce the storage area. Oracle already gives this feature for the table compression as well as for the index compression. when index is created on particular column of a table then it contain some space, which require some storage or disk space by this technique we can save our disk space because in industry the company have to purchase the disk space  according to the size of the their data and pay according to their disk space. To utilize this disk space for useful records data rather than wasting it. In this paper used the data pump utility for the compression of Bitmap index and table. Data pump utility performed for the logical backups in database.in this paper implemented data pump for compression, to release the space and change the index pointing location. It will not release the space even after deletion of records. This is of special interest for the case to compress the bitmap index and table space along with the’S (Data Manipulation Language).

Multi-resolution bitmap indexes for scientific data

2007 ◽  
Vol 32 (3) ◽  
pp. 16 ◽  
Author(s):  
Rishi Rakesh Sinha ◽  
Marianne Winslett
Keyword(s):  
Scientific Data ◽  
Bitmap Indexes

Analyses of multi-level and multi-component compressed bitmap indexes

2010 ◽  
Vol 35 (1) ◽  
pp. 1-52 ◽  
Author(s):  
Kesheng Wu ◽  
Arie Shoshani ◽  
Kurt Stockinger
Keyword(s):  
Multi Level ◽  
Bitmap Indexes

Bitmap Indexes

2012 ◽  
pp. 49-67
Author(s):  
Darl Kuhn ◽  
Sam R. Alapati ◽  
Bill Padfield
Keyword(s):  
Bitmap Indexes
Sign in / Sign up

Export Citation Format

Share Document