Results 1 -
4 of
4
Processing Nested Complex Sequence Pattern Queriesover Event
- Streams,”Proceedings of the 7th Workshop on Data Management for Sensor Networks, Singapore,September 2010
"... ABSTRACT Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These monitoring applications submit complex event queries to track sequences of events that match a given pattern. A ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
(Show Context)
ABSTRACT Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These monitoring applications submit complex event queries to track sequences of events that match a given pattern. As these systems mature the need for increasingly complex nested sequence queries arises, while the state-of-the-art CEP systems mostly focus on the execution of flat sequence queries only. In this paper, we now introduce an iterative execution strategy for nested CEP queries composed of sequence, negation, AND and OR operators. Lastly we have introduced the promising direction of applying selective caching of intermediate results to optimize the execution. Our experimental study using real-world stock trades evaluates the performance of our proposed iterative execution strategy for different query types.
Value-based predicate filtering of XML documents
- DATA & KNOWLEDGE ENGINEERING
, 2008
"... ..."
cqp-Miner: Mining Conserved XML Query Patterns For Evolution-Conscious Caching
"... Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pattern calle ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pattern called conserved query paths (cqp) for efficient caching by integrating the support and evolutionary features together. cqps are paths in qpts that never change or do not change significantly most of the time (if not always) in terms of their support values during a specific time period. We proposed a set of algorithms to extract frequent cqps (fcqps) and infrequent cqps (icqps) and rank these query paths using evolution-conscious ranking functions. Then, these ranked query paths are used in evolution-conscious caching strategy for efficient xml query processing. Finally, we report our experimental results to show that our strategy is superior to previous query pattern-based caching approaches. 2 1
On the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching
"... Abstract. Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pat ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. These approaches ignore the evolutionary features of the qpts. In this paper, we propose a novel type of query pattern called conserved query paths (cqp) for efficient caching by integrating the support and evolutionary features together. cqps are paths in qpts that never change or do not change significantly most of the time (if not always) in terms of their support values during a specific time period. We proposed a set of algorithms to extract frequent cqps (fcqps) and infrequent cqps (icqps) and rank these query paths using evolution-conscious ranking functions. Then, these ranked query paths are used in evolution-conscious caching strategy for efficient xml query processing. Finally, we report our experimental results to show that our strategy is superior to previous qpt-based caching approaches. 1
