All that Incremental is not Efficient: Towards Recomputation Based Complex Event Processing for Expensive Queries

Abstract : Complex Event Processing (CEP) deals with matching a stream of events with the query patterns to extract complex matches. These matches incrementally emerge over time while the partial matches accumulate in the memory. The number of partial matches for expressive CEP queries can be polynomial or exponential to the number of events within a time window. Hence, traditional strategies result in an extensive memory and CPU utilisation. In this paper, we revisit the CEP problem through the lens of complex queries with expressive operators (skip-till-any-match and Kleene+). Our main result is that traditional approaches, based on the partial matches' storage, are inefficient for these types of queries. We advise a simple yet efficient recomputation-based technique that experimentally outperforms traditional approaches on both CPU and memory usage.
Type de document :
Communication dans un congrès
EDBT , Mar 2018, Vienna, Austria
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01711120
Contributeur : Syed Gillani <>
Soumis le : vendredi 16 février 2018 - 18:16:56
Dernière modification le : jeudi 7 février 2019 - 16:01:55
Document(s) archivé(s) le : dimanche 6 mai 2018 - 00:40:54

Fichier

220.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01711120, version 1

Citation

Abderrahmen Kammoun, Syed Gillani, Julien Subercaze, Stéphane Frénot, Kamal Singh, et al.. All that Incremental is not Efficient: Towards Recomputation Based Complex Event Processing for Expensive Queries. EDBT , Mar 2018, Vienna, Austria. 〈hal-01711120〉

Partager

Métriques

Consultations de la notice

254

Téléchargements de fichiers

125