Boolean Expression Tree (BE-Tree)

Research Themes
Project Home Page
BE-Tree is a general index structure for matching Boolean expression which has a wide range of applications including (complex) event processing, publish/subscribe matching, emerging applications in co-spaces, profile matching for targeted web advertising, and approximate string matching. In a comprehensive set of experiments, BE-Tree exhibits signficicant performance improvements over state-of-the-art index structures designed for matching Boolean expressions.

BE-Tree is a dynamic data structure designed to efficiently index Boolean expressions over a high-dimensional discrete space. BE-Tree copes with both high-dimensionality and expressiveness of Boolean expressions by introducing an effective two-phase space-cutting technique that specifically utilizes the discrete and finite domain properties of the space. Furthermore, BE-Tree employs self-adjustment policies to dynamically adapt the tree as the workload changes. Moreover, BE-Tree offers two cache-conscious predicate evaluation techniques, namely, lazy and bitmap evaluations, that also exploit the underlying discrete and finite space to substantially reduce BE-Tree's matching time by up to 75%

BE-Tree is distributed here.

Export BibTex Bibliography