Continuously adaptive continuous queries over streams
Proceedings of the 2002 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
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient filtering of XML documents with XPath expressions
The VLDB Journal — The International Journal on Very Large Data Bases
An XML query engine for network-bound data
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
YFilter: Efficient and Scalable Filtering of XML Documents
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
MJoin: a metadata-aware stream join operator
Proceedings of the 2nd international workshop on Distributed event-based systems
The VLDB Journal — The International Journal on Very Large Data Bases
On-the-fly sharing for streamed aggregation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Query processing for high-volume XML message brokering
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Load shedding in a data stream manager
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
| Hi-index | 0.00 |
XML message brokers play a key role in exchanging information in ubiquitous environments. One of their core technical issues is difficulty associated with processing a set of XPath queries for multiple continuous filtering over incoming XML streams. This paper proposes a novel system designed to provide an epochal solution to this problem. The proposed system provides efficient data structures and matching algorithm in order to minimize the runtime workload of continuous filtering over XML streams. Also, the performance of proposed approach is verified through a variety of experiments, including comparisons with YFilter. The proposed approach is practically linear-scalable and stable in terms of processing a set of XPath queries in a continuous and timely fashion. Furthermore, this approach consistently outperforms YFilter, particularly under conditions of low selectivity.