International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
An iceberg query is a special class of an aggregate query that computes aggregate values upon a user given Threshold (T). An iceberg query evaluation using compressed bitmap index strategy is an efficient strategy which prunes the bitmap vectors. Hence, this index technique is used in the authors' proposed approach. In this paper, they propose an effective strategy of ordering the priority queues with highest initial 1's count to achieve optimal pruning of bitmap vectors. This is because there is a high probability for selection of more common 1 bits in vector. Exhaustive experimentation demonstrates their strategy is much more efficient than existing strategy.