Open access research
publication repository

Compressed bitmap indexes: beyond unions and intersections [r-libre/261]

Kaser, Owen, & Lemire, Daniel (2016). Compressed bitmap indexes: beyond unions and intersections. Software: Practice and Experience, 46 (2). https://doi.org/10.1002/spe.2289

File(s) available for this item:
[img]  PDF - symmetricbitmap.pdf
Content : Accepted Version
License : Creative Commons Attribution.
Item Type: Journal Articles
Refereed: Yes
Status: Published
Abstract: Compressed bitmap indexes are used to speed up simple aggregate queries in databases. Indeed, set operations like intersections, unions and complements can be represented as logical operations (AND,OR,NOT) that are ideally suited for bitmaps. However, it is less obvious how to apply bitmaps to more advanced queries. For example, we might seek products in a store that meet some, but maybe not all, criteria. Such threshold queries generalize intersections and unions; they are often used in information-retrieval and data-mining applications. We introduce new algorithms that are sometimes three orders of magnitude faster than a naive approach. Our work shows that bitmap indexes are more broadly applicable than is commonly believed.
Official URL: http://onlinelibrary.wiley.com/doi/10.1002/spe.228...
Depositor: Lemire, Daniel
Owner / Manager: Daniel Lemire
Deposited: 05 Sep 2014 13:00
Last Modified: 20 Mar 2016 19:13

Actions (login required)