Validated cost models for sensor network queries

Christian Y A Brenninkmijer; Ixent Galpin; Alvaro A A Fernandes; Norman W. Paton

doi:10.1145/1594187.1594198

Validated cost models for sensor network queries

Christian Y A Brenninkmijer, Ixent Galpin, Alvaro A A Fernandes, Norman W. Paton

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) as query processing platforms, it was quickly noticed that the corresponding optimization problem is even more challenging than the classical one, since, in comparison to classical platforms, a WSN is a very constrained computational infrastructure (in terms of memory, processing, and communication capabilities, and, crucially, depletable energy stocks). Optimizing a declarative query for execution in WSNs is thereby made both more important and more challenging. One of the requirements for effective query optimization is the availability of effective models for estimating the cost of alternative execution plans. This paper describes how query cost models for space, time and energy were methodically derived and validated for an expressive algebra for continuous queries over sensor streams. Copyright © 2009 ACM.

Original language	English
Title of host publication	ACM International Conference Proceeding Series\|ACM Int. Conf. Proc. Ser.
Publisher	Association for Computing Machinery
Pages	17-22
Number of pages	5
ISBN (Print)	9781605587776
DOIs	https://doi.org/10.1145/1594187.1594198
Publication status	Published - 2009
Event	6th International Workshop on Data Management for Sensor Networks, DMSN'09 - in conjunction with the 35th International Conference on Very Large Data Bases - Lyon Duration: 1 Jul 2009 → … http://dblp.uni-trier.de/db/conf/dmsn/dmsn2009.html#BrenninkmeijerGFP09http://dblp.uni-trier.de/rec/bibtex/conf/dmsn/BrenninkmeijerGFP09.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/dmsn/BrenninkmeijerGFP09

Publication series

Name	ACM International Conference Proceeding Series

Conference

Conference	6th International Workshop on Data Management for Sensor Networks, DMSN'09 - in conjunction with the 35th International Conference on Very Large Data Bases
City	Lyon
Period	1/07/09 → …
Internet address	http://dblp.uni-trier.de/db/conf/dmsn/dmsn2009.html#BrenninkmeijerGFP09http://dblp.uni-trier.de/rec/bibtex/conf/dmsn/BrenninkmeijerGFP09.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/dmsn/BrenninkmeijerGFP09

Keywords

H.2.3 [database management]: languages-query optimization, cost models, sensor networks

Access to Document

10.1145/1594187.1594198

Cite this

@inproceedings{2f951b14b727447a913fb6f3e5eb956c,

title = "Validated cost models for sensor network queries",

abstract = "Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) as query processing platforms, it was quickly noticed that the corresponding optimization problem is even more challenging than the classical one, since, in comparison to classical platforms, a WSN is a very constrained computational infrastructure (in terms of memory, processing, and communication capabilities, and, crucially, depletable energy stocks). Optimizing a declarative query for execution in WSNs is thereby made both more important and more challenging. One of the requirements for effective query optimization is the availability of effective models for estimating the cost of alternative execution plans. This paper describes how query cost models for space, time and energy were methodically derived and validated for an expressive algebra for continuous queries over sensor streams. Copyright {\textcopyright} 2009 ACM.",

keywords = "H.2.3 [database management]: languages-query optimization, cost models, sensor networks",

author = "Brenninkmijer, {Christian Y A} and Ixent Galpin and Fernandes, {Alvaro A A} and Paton, {Norman W.}",

year = "2009",

doi = "10.1145/1594187.1594198",

language = "English",

isbn = "9781605587776",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

pages = "17--22",

booktitle = "ACM International Conference Proceeding Series|ACM Int. Conf. Proc. Ser.",

address = "United States",

note = "6th International Workshop on Data Management for Sensor Networks, DMSN'09 - in conjunction with the 35th International Conference on Very Large Data Bases ; Conference date: 01-07-2009",

url = "http://dblp.uni-trier.de/db/conf/dmsn/dmsn2009.html#BrenninkmeijerGFP09http://dblp.uni-trier.de/rec/bibtex/conf/dmsn/BrenninkmeijerGFP09.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/dmsn/BrenninkmeijerGFP09",

}

Brenninkmijer, CYA, Galpin, I, Fernandes, AAA & Paton, NW 2009, Validated cost models for sensor network queries. in ACM International Conference Proceeding Series|ACM Int. Conf. Proc. Ser.. ACM International Conference Proceeding Series, Association for Computing Machinery, pp. 17-22, 6th International Workshop on Data Management for Sensor Networks, DMSN'09 - in conjunction with the 35th International Conference on Very Large Data Bases, Lyon, 1/07/09. https://doi.org/10.1145/1594187.1594198

Validated cost models for sensor network queries. / Brenninkmijer, Christian Y A; Galpin, Ixent; Fernandes, Alvaro A A et al.
ACM International Conference Proceeding Series|ACM Int. Conf. Proc. Ser.. Association for Computing Machinery, 2009. p. 17-22 (ACM International Conference Proceeding Series).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Validated cost models for sensor network queries

AU - Brenninkmijer, Christian Y A

AU - Galpin, Ixent

AU - Fernandes, Alvaro A A

AU - Paton, Norman W.

PY - 2009

Y1 - 2009

N2 - Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) as query processing platforms, it was quickly noticed that the corresponding optimization problem is even more challenging than the classical one, since, in comparison to classical platforms, a WSN is a very constrained computational infrastructure (in terms of memory, processing, and communication capabilities, and, crucially, depletable energy stocks). Optimizing a declarative query for execution in WSNs is thereby made both more important and more challenging. One of the requirements for effective query optimization is the availability of effective models for estimating the cost of alternative execution plans. This paper describes how query cost models for space, time and energy were methodically derived and validated for an expressive algebra for continuous queries over sensor streams. Copyright © 2009 ACM.

AB - Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) as query processing platforms, it was quickly noticed that the corresponding optimization problem is even more challenging than the classical one, since, in comparison to classical platforms, a WSN is a very constrained computational infrastructure (in terms of memory, processing, and communication capabilities, and, crucially, depletable energy stocks). Optimizing a declarative query for execution in WSNs is thereby made both more important and more challenging. One of the requirements for effective query optimization is the availability of effective models for estimating the cost of alternative execution plans. This paper describes how query cost models for space, time and energy were methodically derived and validated for an expressive algebra for continuous queries over sensor streams. Copyright © 2009 ACM.

KW - H.2.3 [database management]: languages-query optimization, cost models, sensor networks

U2 - 10.1145/1594187.1594198

DO - 10.1145/1594187.1594198

M3 - Conference contribution

SN - 9781605587776

T3 - ACM International Conference Proceeding Series

SP - 17

EP - 22

BT - ACM International Conference Proceeding Series|ACM Int. Conf. Proc. Ser.

PB - Association for Computing Machinery

T2 - 6th International Workshop on Data Management for Sensor Networks, DMSN'09 - in conjunction with the 35th International Conference on Very Large Data Bases

Y2 - 1 July 2009

ER -

Validated cost models for sensor network queries

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this