A small library for building and operating on bit indexes. A bit index of composed of a domain and a table. A domain maps a set of uint32 members to bit positions. The table contains a set of sparse bit arrays for each key in the index.

For example, given a set of fruit choices (called the domain):

• Apples
• Cherries
• Peaches
• Grapes

and a set of people (referred to as keys) with the fruit they enjoy (referred to at the item set):

• Bob: [Apples, Peaches]
• Sue: [Grapes]
• Joe: [Grapes, Cherries, Peaches]

The resulting matrix would look like this:

|Apples|Cherries|Peaches|Grapes ----|------|--------|-------|------ Bob|1|0|1|0 Sue|0|0|0|1 Joe|0|1|1|1

Once the index is built, lookup operations can be performed to find the items that match certain criteria:

• any - Find all keys that have membership for any item in the lookup set.
• all - Find all keys that have membership for all items in the lookup set.
• not any - Find all keys that do not have membership for any item in the lookup set.
• not all - Find all keys that do not have membership for all items in the lookup set.

Applying these operations to the example:

• People who enjoy Apples or Cherries (an any operation) would match Bob and Joe.
• People who enjoy Apples and Peaches (an all operation) would match Bob.
• People who do not enjoy Peaches or Apples (a not any operation) would match Sue.
• People who do not enjoy Grapes and Cherries (a not all operation) would match Bob and Sue.

Download a release from the releases page for your architecture.

Clone the repository and run the following to install bitindex in your $GOPATH/bin directory.

$ make install build

To build an index, the input stream must be in one of the supported formats. For this example, we will use a CSV format and assuming the fruit and people have the following IDs.

An index requires use of unsigned 32-bit integers, so we can use the IDs to encoded the labels.

$ cat << EOF > fruit.csv
person,fruit
100,1
100,3
101,4
102,4
102,2
102,3
EOF

To build the index, use the build command. Since we included a CSV header, we add the flag to denote that. The index is written to stdout by default, but we included the --output option to specify a filename.

$ bitindex build --format=csv --csv-header --output=fruit.bitx fruit.csv

This will output the following

Build time: 22.684µs
Statistics
* Domain size: 4
* Table size: 3
* Sparsity: 0

The domain size is equal to the number of fruit and the table size is the number of people.

As noted above, the four operations that are supported are any, all, nany, and nall. Any or all of these flags can be passed with a comma-separated list of fruit IDs. Below query the index for the questions asked above.

Apples or Cherries

$ bitindex query --any=1,2 fruit.bitx
100
102

Apples and Peaches

$ bitindex query --all=1,3 fruit.bitx
100

Not (Peaches or Apples)

$ bitindex query --nany=3,1 fruit.bitx
101

Not (Grapes and Cherries)

$ bitindex query --nall=4,2 fruit.bitx
100
101

To use the index in a real environment, the bitindex server would be started and RPC requests could be use to query the index.

Start the server by using the serve command.

$ bitindex serve fruit.bitx
Listening on 127.0.0.0:7000...

Domain

curl 127.0.0.1:7000/domain
{
    "complement": false,
    "items": [1, 2, 3, 4]
}

Keys

curl 127.0.0.1:7000/keys
{
    "complement": false,
    "item": [100, 101, 102]
}

Query

curl -X POST 127.0.0.0:7000/query -d '{"any": [1, 2]}'
{
    "complement": false,
    "items": [100, 102]
}

Currently, the only supported format is CSV.

The Dockerfile defaults to running the HTTP service. The volume is required if the image is used as is.

docker run -v /path/to/data.bitx:/data.bitx -p 7000:7000 -d dbhi/bitindex

An alternate method would be to extend the image and copy the index into the image itself.