A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Bit-sliced index arithmetic

2001
*
SIGMOD record
*

The bit-sliced index (BSI) was originally defined in [ONQ97] . The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how to efficiently generate new BSI's Z, V, and W, such that Z = X + Y, V = X -Y, and W = MIN(X, Y); this means that if a row r in T has a value x represented in BSI X and a value y in BSI Y, the value for r i n BSI Z will be x + y, the value in V will be x -y and the value i n W will be MIN(x, y). Since a bitmap representing

doi:10.1145/376284.375669
fatcat:77ut6v6apbdrhelzjqtxdugjj4