This is a novel framework for generating Boolean Expression, BEGen, workloads with different characteristics such as workload distribution, workload size, space dimensionality, average subscription and event size, dimension cardinality, predicate selectivity, dimension selectivity, subscription expressiveness, and event matching probability. BEGen is written in C (the source code/user manual will be released soon).

This framework is part of the work in BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space (SIGMOD'11).