Scientific and Statistical Database Management, International Conference on (2006)
July 3, 2006 to July 5, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SSDBM.2006.37
Cedric du Mouza , Univ. Paris-Dauphine Paris, France
Philippe Rigaux , Univ. Paris-Dauphine Paris, France
Michel Scholl , Lab. CEDRIC CNAM Paris, France
<p>We consider an environment where a subscription system continuously evaluates pattern-based requests over unbounded sequential data. We propose an extension of the traditional pattern-matching techniques for efficiently handling large sets of such continuous queries. This extension relies on the introduction of variables in patterns in order to augment their expressivity.</p> <p>Based on this extended class of parameterized queries, our main contributions are threefold. First, we define a refinement relation based on variable relaxation. Second, we use the semi-lattice structure of the set of parameterized patterns for patterns aggregation and filtering. We propose an on-line pattern aggregation algorithm so as to both reduce the cost of pattern-matching evaluation as well as to filter out sequences that cannot match any of the patterns in a subscription cluster. Finally we show, through analysis and experiments, that our technique reduces quite effectively the cost of the matching process.</p>
P. Rigaux, C. du Mouza and M. Scholl, "On-line Aggregation and Filtering of Pattern-based Queries," 18th International Conference on Scientific and Statistical Database Management(SSDBM), Vienna, 2006, pp. 333-342.