Products

aggregate query processing in sensor networks

Aggregate query processing in the presence of

Section snippets Sensor networks. We consider a sensor network consisting of n stationary sensor nodes {s 1, s 2,,s n} deployed in a field of interest and a powered base station serving as an access point for users to pose ad hoc queries. As a basic primitive to collect sensing data in WSNs, we use an ad hoc spanning tree, such as TinyDB [21], SNEE [10], and AnduIn [16] as the basic

More

(PDF) Aggregate Queries in Wireless Sensor Networks

of aggregate quer y processing in w ireless sensor networks, this paper proposes Buck et-based P arallel Aggregation (BP A). BP A divides a query region into several cells according to the dist

More

Aggregate Threshold Queries in Sensor Networks

Abstract: An important class of queries over sensor networks are network-wide aggregation queries. In this work we study a class of aggregation queries which we refer to as aggregate threshold queries. The goal of an aggregate threshold query is to continuously monitor the network and give a notification every time an aggregated value crosses a predetermined threshold value.

More

Routing and processing multiple aggregate queries in

We present a novel approach to processing continuous aggregate queries in sensor networks, which lifts the assumption of tree-based routing. Given a query workload and a special-purpose gateway node where results are expected, the query optimizer exploits query correlations in order to generate an energy-efficient distributed evaluation plan.

More

Assembling Regions for Efficacious Aggregate Query

2019-4-10 · Assembling Regions for Efficacious Aggregate Query Processing in Wireless Sensor Networks by Apostolos Fertis Diploma, Electrical and Computer Engineering (2003) National Technical University of Athens Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements of

More

Interplay of processing and routing in aggregate query

2007-11-1 · Interplay of processing and routing in aggregate query optimization for sensor networks Niki Trigoni Alexandre Guitton Antonios Skordylis Computing Laboratory, University of Oxford, Oxford OX1 3QD, UK Abstract. This paper presents a novel approach to processing continuous aggre-gate queries in sensor networks, which lifts the assumption of tree

More

Processing Approximate Aggregate Queries in Wireless

2007-7-3 · routing [4, 26] and in-network query processing [14, 15, 16, 28]. A survey of the applications and the challenges that sensor networks introduce is presented in [10]. For monitoring queries that aggregate the observed values from a group of sensor nodes, [14] suggested the construction of a greedy aggregation tree that seeks to maximize the

More

Accuracy vs. Lifetime: Linear Sketches for Aggregate

1.1 Query Processing in Sensor Networks Queries are considered a natural way for users to interact with the sensor net-work [37]. Further, sensor network applications rely heavily on query processing, particularly of aggregate queries. In this paper we are interested in evaluating aggre-

More

Routing and processing multiple aggregate queries in

We present a novel approach to processing continuous aggregate queries in sensor networks, which lifts the assumption of tree-based routing. Given a query workload and a special-purpose gateway node where results are expected, the query optimizer exploits query correlations in order to generate an energy-efficient distributed evaluation plan.

More

Processing approximate aggregate queries in wireless

2006-12-1 · Consider a node Root, which initiates a continuous query over the values observed by a set of data sources, and requests that the results of this query be reported to it at regular time periods.The time interval between two such consecutive time periods is referred to as the epoch of the query. The continuous query is disseminated through the network in search of the sensor nodes that collect

More

Query Processing for Sensor Networks

2011-9-16 · layer for sensor networks; we call the component of the system that is located on each sensor node the query proxy. Architecturally, on the sensor node, the query proxy lies between the network layer and the application layer, and the query proxy provides higher-level services through queries. Given the view of a sensor network as a huge dis-

More

Robust Aggregation in Sensor Networks cs.utah.edu

2011-8-9 · on sensor networks has been advocated [24, 29], with particular attention paid to efficient query processing for aggregation queries [24, 29, 31]. In the TAG system [24], users connect to the sensor network using a workstation or base station directly connected to a sensor designated as the sink.

More

IJA: an efficient algorithm for query processing in

IJA: an efficient algorithm for query processing in sensor networks. Lee HC(1), Lee YJ, Lim JH, Kim DH. By way of example while simple queries, such as select and aggregate queries, in sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. Therefore, in this paper

More

Efficient Iceberg Query Processing in Sensor Networks

2015-11-26 · Efficient Iceberg Query Processing in Sensor Networks Heejung Yang and Chin-Wan Chung∗ Department of Computer Science, KAIST, Daejeon 305-701, Republic of Korea ∗Corresponding author: [email protected] The iceberg query finds data whose aggregate values exceed a pre-specified threshold. To process

More

IJA: An Efficient Algorithm for Query Processing in Sensor

2014-6-21 · Thus query processing over the nodes should be constrained because of their limitations. Due to the problems, the join operations in sensor networks are typically processed in a distributed manner over a set of nodes and have been studied. By way of example while simple queries, such as select and aggregate queries, in sensor networks

More

TinyQP: A Query Processing System in Wireless Sensor

2013-6-14 · In this demo we show a Query Processing system based on TinyOS in WSNs, which is called TinyQP. TinyQP provides the in-network processing of several complex queries including real time query, historical query, event detection, aggregate query, top-k query, etc. TinyQP displays the network topology in a graphical way.

More

abstract for aggregate query processing in peer to p

Processing spatial keyword query as a top-k aggregation query. 3 Jul 2014 Processing spatial keyword query as a top-k aggregation query. Full Text: PDF Tags: search process spatial keyword search top-k aggregation .. full collection, when only a small subset of the

More