Bitmap Index Implementation
Abstract
Bitmapped indexes are useful in processing complex queries in decision
support systems, and they have been implemented in several commercial database
systems. The purpose of this project is to implement a bitmapped index
and R-trees using the Berley GiST package and compare these indexing methods.
We have implemented the bitmapped indexing using the GiST B-Tree extension.
Functions have been developed to create a bitmap index and efficiently
retrieve data from the index.
We also present a study of the various bitmapping schemes and their
merits.
The R-tree implementation has been planned as future work.
Guide
Prof. Sunita Sarawagi
Authors
Vijay T. Raisinghani
Rahul Jha