dc.contributor.author | Goyal, Navneet | |
dc.contributor.author | Sharma, Yashvardhan | |
dc.date.accessioned | 2022-12-26T09:57:01Z | |
dc.date.available | 2022-12-26T09:57:01Z | |
dc.date.issued | 2009-01 | |
dc.identifier.uri | https://dl.acm.org/doi/10.1145/1517303.1517327 | |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8132 | |
dc.description.abstract | Bitmap indices are the preferred indexing structures for read only & high dimensional data in data warehouses and scientific databases. High cardinality attributes pose a new challenge in terms of having space efficient bitmap indices. Binning is a common technique for reducing space requirements of bitmap indices. It is found that binning has an adverse affect on the query performance. A new efficient binning strategy is proposed for bitmap indices for high cardinality attributes. Exact bins are created based on query distribution. Exact bins are allowed to overlap. This gives a considerable performance advantage over the conventional non-overlapping bins at the expense of marginal increase in space overheads. Overlapping bins minimize the number of candidate-checks that need to be performed for a given set of queries. Algorithms are also presented for performing candidate checks more efficiently. Experimental results are presented in support of the new binning strategy. | en_US |
dc.language.iso | en | en_US |
dc.publisher | ACM Digital Library | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Bitmap indices | en_US |
dc.title | New binning strategy for bitmap indices on high cardinality attributes | en_US |
dc.type | Article | en_US |
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |