BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space

Authors:
Mohammad Sadoghi;Hans-Arno Jacobsen
Affiliations:
University of Toronto, Toronto, ON, Canada;University of Toronto, Toronto, ON, Canada
Venue:
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Year:
2011

Citing 23
Cited 8

A predicate matching algorithm for database rule systems

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Index structures for selective dissemination of information under the Boolean model

ACM Transactions on Database Systems (TODS)
A general solution of the n-dimensional B-tree problem

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Matching events in a content-based subscription system

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Filtering algorithms and implementation for very fast publish/subscribe systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient filtering in publish-subscribe systems using binary decision diagrams

ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
When Is ''Nearest Neighbor'' Meaningful?

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Practical Applications of Triggers and Constraints: Success and Lingering Issues (10-Year Award)

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Event matching in symmetric subscription systems

CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
Scalable Trigger Processing

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Path sharing and predicate evaluation for high-performance XML filtering

ACM Transactions on Database Systems (TODS)
Efficient matching for state-persistent publish/subscribe systems

CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Benchmarking declarative approximate selection predicates

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Cayuga: a high-performance event processing engine

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
The Claremont report on database research

ACM SIGMOD Record
DejaVu: declarative pattern matching over live and archived streams of events

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficiently evaluating complex boolean expressions

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
High-performance dynamic pattern matching over disordered streams

Proceedings of the VLDB Endowment
Efficient event processing through reconfigurable hardware for algorithmic trading

Proceedings of the VLDB Endowment
GPX-matcher: a generic boolean predicate-based XPath expression matcher

Proceedings of the 14th International Conference on Extending Database Technology

Towards highly parallel event processing through reconfigurable hardware

Proceedings of the Seventh International Workshop on Data Management on New Hardware
Towards vulnerability-based intrusion detection with event processing

Proceedings of the 5th ACM international conference on Distributed event-based system
fpga-ToPSS: line-speed event processing on fpgas

Proceedings of the 5th ACM international conference on Distributed event-based system
Towards an extensible efficient event processing kernel

PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Pub/Sub on stream: a multi-core based message broker with QoS support

Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
High-performance location-aware publish-subscribe on GPUs

Proceedings of the 13th International Middleware Conference
Analysis and optimization for boolean expression indexing

ACM Transactions on Database Systems (TODS)
Publish/subscribe middleware for energy-efficient mobile crowdsensing

Proceedings of the 2013 ACM conference on Pervasive and ubiquitous computing adjunct publication

Quantified Score

Hi-index	0.01

Visualization

Abstract

BE-Tree is a novel dynamic tree 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 a novel 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. We conduct a comprehensive evaluation to demonstrate the superiority of BE-Tree in comparison with state-of-the-art index structures designed for matching Boolean expressions.