Proceedings ArticleDOI
GPX-matcher: a generic boolean predicate-based XPath expression matcher
Mohammad Sadoghi,Ioana Burcea,Hans-Arno Jacobsen +2 more
- pp 45-56
Reads0
Chats0
TLDR
A novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automaton-based algorithms, is developed which significantly outperforms state-of-the-art algorithms for efficiently solving this matching problem.Abstract:
Content-based architectures for XML data dissemination are gaining increasing attention both in academia and industry These dissemination networks are the building blocks of selective information dissemination applications which have wide applicability such as sharing and integrating information in both scientific and corporate domains At the heart of these dissemination services is a fast engine for matching of an incoming XML message against stored XPath expressions to determine interested consumers for the message To achieve the ultra-low response time, predominant in financial message processing, the XPath expression matching must be done efficiently In this paper, we develop and evaluate a novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automaton-based algorithms, for efficiently solving this matching problem We demonstrate a matching time in the millisecond range for millions of XPath expressions which significantly outperforms state-of-the-art algorithmsread more
Citations
More filters
Proceedings ArticleDOI
BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space
TL;DR: A comprehensive evaluation is conducted to demonstrate the superiority of BE-Tree in comparison with state-of-the-art index structures designed for matching Boolean expressions.
Proceedings ArticleDOI
Scalable aggregation on multicore processors
TL;DR: This paper aims to provide a solution to performing in-memory parallel aggregation on the Intel Nehalem architecture, and considers several previously proposed techniques, including a hybrid independent/shared method and a method that clones data items automatically when contention is detected.
Journal ArticleDOI
Analysis and optimization for boolean expression indexing
TL;DR: This work develops two novel 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%.
Proceedings ArticleDOI
Towards highly parallel event processing through reconfigurable hardware
TL;DR: In this article, the authors present an efficient event processing platform to support high-frequency and low-latency event matching over reconfigurable hardware, where each solution is formulated as a design trade-off between the degree of parallelism versus the desired application requirement.
Proceedings ArticleDOI
Towards vulnerability-based intrusion detection with event processing
TL;DR: This work places event processing in the core of the IDS and proposes novel algorithms to efficiently match vulnerability signatures and is among the first to detect complex attacks such as the Conficker worm which requires correlating multiple protocol data units (MPDUs) while maintaining a small memory footprint.
References
More filters
Proceedings ArticleDOI
Matching events in a content-based subscription system
TL;DR: It is proved that for predicates reducible to conjunctions of elementary tests, the expected time to match a random event is no greater than O(N 1 ) where N is the number of subscriptions, and is a closed-form expression that depends on the number and type of attributes.
Proceedings ArticleDOI
Filtering algorithms and implementation for very fast publish/subscribe systems
Françoise Fabret,H.-Arno Jacobsen,François Llirbat,João Pereira,Kenneth A. Ross,Dennis Shasha +5 more
TL;DR: In this article, the authors describe an attempt at the construction of such algorithms and its implementation using a combination of data structures, application-specific caching policies, and application specific query processing, which can handle 600 events per second for a typical workload containing 6 million subscriptions.
Journal ArticleDOI
Path sharing and predicate evaluation for high-performance XML filtering
TL;DR: The results show that the path sharing employed by YFilter can provide order-of-magnitude performance benefits, and two alternative techniques for extending YFilter's shared structure matching with support for value-based predicates are proposed, and the performance of these two techniques are compared.
Proceedings ArticleDOI
Efficient filtering of XML documents with XPath expressions
TL;DR: This paper proposes a novel index structure, termed XTrie, that supports the efficient filtering of XML documents based on XPath expressions and offers several novel features that, it believes, make it especially attractive for large-scale publish/subscribe systems.
Proceedings ArticleDOI
Stream processing of XPath queries with predicates
Ashish Kumar Gupta,Dan Suciu +1 more
TL;DR: A number of optimization techniques are described to make the lazy XPush machine more efficient, both in terms of space and time, and the combination of these optimizations results in high, sustained throughput.