Index structures for selective dissemination of information under the Boolean model
ACM Transactions on Database Systems (TODS)
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
Processing XML Streams with Deterministic Automata
ICDT '03 Proceedings of the 9th International Conference on Database Theory
WebFilter: A High-throughput XML-based Publish and Subscribe System
Proceedings of the 27th International Conference on Very Large Data Bases
Predicate Matching and Subscription Matching in Publish/Subscribe Systems
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Efficient filtering of XML documents with XPath expressions
The VLDB Journal — The International Journal on Very Large Data Bases
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
Batched Processing for Information Filters
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Predicate-based Filtering of XPath Expressions
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
AFilter: adaptable XML filtering with prefix-caching suffix-clustering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Early profile pruning on XML-aware publish-subscribe systems
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Value-based predicate filtering of XML documents
Data & Knowledge Engineering
Routing of XML and XPath Queries in Data Dissemination Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Fast XML document filtering by sequencing twig patterns
ACM Transactions on Internet Technology (TOIT)
Reliable and Highly Available Distributed Publish/Subscribe Service
SRDS '09 Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems
A distributed service-oriented architecture for business process execution
ACM Transactions on the Web (TWEB)
Proceedings of the VLDB Endowment
Efficient event processing through reconfigurable hardware for algorithmic trading
Proceedings of the VLDB Endowment
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
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
Towards an extensible efficient event processing kernel
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Location-based matching in publish/subscribe revisited
Proceedings of the Posters and Demo Track
Analysis and optimization for boolean expression indexing
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
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 algorithms.