Cost-Optimal Execution of Boolean DNF Trees with Shared Streams

Abstract : Several applications process queries expressed as trees of Booleanoperators applied to predicates on sensor data streams, e.g., mobile appsand automotive apps. Sensor data must be retrieved from the sensors, whichincurs a cost, e.g., an energy expense that depletes the battery of a mobile device, abandwidth usage. The objective is to determine the order in whichpredicates should be evaluated so as to shortcut part of the queryevaluation and minimize the expected cost. This problem has been studiedassuming that each data stream occurs at a single predicate. In this workwe study the case in which a data stream occurs in multiple predicates,either when each predicate references a single stream or when a predicatecan reference multiple streams. In the single-stream case we give anoptimal algorithm for a single-level tree and show that the problem isNP-complete for DNF trees. For DNF trees we show that there exists an optimal predicate evaluation order that is depth-first, which provides a basis for designinga range of heuristics. In the multi-stream case we show that the problemis NP-complete even for single-level trees. As in the single stream case,for DNF trees we show that there exists a depth-first leaf evaluation order that isoptimal and we design efficient heuristics.
Type de document :
Rapport
[Research Report] RR-8616, INRIA. 2014
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01079868
Contributeur : Equipe Roma <>
Soumis le : jeudi 11 décembre 2014 - 20:58:49
Dernière modification le : mercredi 11 avril 2018 - 01:54:39
Document(s) archivé(s) le : jeudi 12 mars 2015 - 11:20:59

Fichier

RR-8616.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01079868, version 2

Citation

Henri Casanova, Lipyeow Lim, Yves Robert, Frédéric Vivien, Dounia Zaidouni. Cost-Optimal Execution of Boolean DNF Trees with Shared Streams. [Research Report] RR-8616, INRIA. 2014. 〈hal-01079868v2〉

Partager

Métriques

Consultations de la notice

316

Téléchargements de fichiers

107