Proceedings of the 10th ACM International Workshop on Data Engineering for Wireless and Mobile Access 2011
DOI: 10.1145/1999309.1999318
|View full text |Cite
|
Sign up to set email alerts
|

Extending query languages for in-network query processing

Abstract: Sensor networks have become ubiquitous and their proliferation in day-to-day life provides new research challenges. Sensors deployed at forest sites, high performance facilities, or areas striken by environmental, or other, phenomena, are only a few representative examples. More recently, mobile sensor networks have made their presence and are rapidly growing in numbers, such as the successful ZebraNet project or PDAs and smartphones. Nevertheless, such networks have mainly been used for data acquisition and d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 23 publications
0
3
0
Order By: Relevance
“…The work in [100] is an enhancement over SNEE. The basic idea is based on declarative query ptimize, and deploy automatic data analysis techniques in a sensor network.…”
Section: Cross-layer Optimizationmentioning
confidence: 99%
“…The work in [100] is an enhancement over SNEE. The basic idea is based on declarative query ptimize, and deploy automatic data analysis techniques in a sensor network.…”
Section: Cross-layer Optimizationmentioning
confidence: 99%
“…The occurrence of an inten- sional extent triggers its substitution by a templated subplan, which performs its algorithmic computations. We collectively refer to this process as query refactoring [208]. In essense, we reformulate an initially posed query into an equivalent one, that is also expressed in the same declarative language (SNEEql).…”
Section: Query Refactoringmentioning
confidence: 99%
“…Our approach is to model data mining algorithms as extensional extents, allowing us to include them in declarative queries like any other extent (e.g., relation, view, etc.) [208]. For the same reason, query execution engines are able to optimize these constructs, as long as they can be expressed with the declarative language.…”
mentioning
confidence: 99%