Show simple item record

dc.contributorSafiullah, Muhammad Assaden_US
dc.date.accessioned2008-09-17T23:35:08Z
dc.date.accessioned2011-08-24T21:42:01Z
dc.date.available2008-09-17T23:35:08Z
dc.date.available2011-08-24T21:42:01Z
dc.date.issued2008-09-17T23:35:08Z
dc.date.submittedJuly 2008en_US
dc.identifier.urihttp://hdl.handle.net/10106/1104
dc.description.abstractGrowing complexity of enterprise-wide data and business processes necessitates the efficiency of complex decision support set queries. However, contemporary DBMS remain unsuccessful in handling set queries efficiently. In this thesis we propose efficient set query processing methods using bitmap index. The methods use bitmap vectors to represent attributes values in binary format. The methods test groups within a schema in a hierarchical fashion. Satisfying groups are bisected further and checked recursively while non-satisfying groups are pruned resulting in significant reduction in response times. In addition, our iterative implementation avoids the inefficiency that can be introduced by recursive implementation by reading the same bitmap vector for intersection many times. We also introduce pre-processing methods to reduce the complexity of the bitmap vectors, thus to improve the efficiency. Our implementation is based on FastBit, an open-source efficient compressed bitmap index framework. Experimental results on large datasets and comparison with results from PostgreSQL prove that our approach is superior owing to the fact that we are able to discard non-satisfying groups and capably optimize complex queries.en_US
dc.language.isoENen_US
dc.publisherComputer Science & Engineeringen_US
dc.titleEfficient Processing Of Set Queries Using Bitmap Indexen_US
dc.typeM.S.en_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record