文摘
DEXIN, an event matching algorithm for publish/subscribe systems, is proposed. DEXIN supports point-based and limited/unlimited range-based constraints. DEXIN executes a dynamic pipelined event matching process with two different methods. DEXIN uses a low-cost near-optimal algorithm to minimize the event matching cost. The superiority of DEXIN is demonstrated by extensive evaluations and comparisons.