All that Incremental is not Efficient: Towards Recomputation Based Complex Event Processing for Expensive Queries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

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

Résumé

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.
Fichier principal
Vignette du fichier
220.pdf (833.18 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01711120 , version 1 (16-02-2018)

Identifiants

  • HAL Id : hal-01711120 , version 1

Citer

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⟩
304 Consultations
140 Téléchargements

Partager

Gmail Facebook X LinkedIn More