Sorting improves word-aligned bitmap indexes

Details Sorting improves word-aligned bitmap indexes Sorting improves word-aligned bitmap indexes

2009-01-23

arxiv.org/abs/0901.3751v4

Daniel Lemire, Owen Kaser, Kamel Aouiche, Sorting improves word-aligned bitmap indexes, Data & Knowledge Engineering, Volume 6

Computer Science

Databases

Scientific paper

10.1016/j.datak.2009.08.006

Bitmap indexes must be compressed to reduce input/output costs and minimize CPU usage. To accelerate logical operations (AND, OR, XOR) over bitmaps, we use techniques based on run-length encoding (RLE), such as Word-Aligned Hybrid (WAH) compression. These techniques are sensitive to the order of the rows: a simple lexicographical sort can divide the index size by 9 and make indexes several times faster. We investigate row-reordering heuristics. Simply permuting the columns of the table can increase the sorting efficiency by 40%. Secondary contributions include efficient algorithms to construct and aggregate bitmaps. The effect of word length is also reviewed by constructing 16-bit, 32-bit and 64-bit indexes. Using 64-bit CPUs, we find that 64-bit indexes are slightly faster than 32-bit indexes despite being nearly twice as large.

Affiliated with

Also associated with

No associations

Rating

Sorting improves word-aligned bitmap indexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sorting improves word-aligned bitmap indexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorting improves word-aligned bitmap indexes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-66424