How to control unfolding when specializing interpreters
New Generation Computing
Partial evaluation in logic programming
Journal of Logic Programming
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Rewriting queries using views with access patterns under integrity constraints
Theoretical Computer Science
The design and implementation of a declarative sensor network system
Proceedings of the 5th international conference on Embedded networked sensor systems
Query Processing in Sensor Networks
IEEE Pervasive Computing
A Framework for Semantic Sensor Network Services
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
An Architecture for Query Optimization in Sensor Networks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Finding Equivalent Rewritings with Exact Views
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Beyond average: toward sophisticated sensing with queries
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Ontology-driven complex event processing in heterogeneous sensor networks
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
| Hi-index | 0.00 |
Partial deduction is an optimisation technique developed by the logic programming community. We propose the use of Partial deduction in the domain of wireless sensor network programming where programs are written for small computational platforms and energy is typically scarce. We show how, together with a declarative programming language which has been shown to be suitable for several demanding sensor network applications, it can address key issues such as rewriting a query using views and reducing redundancy of rewritings as long as some computation and abstraction can be performed at compile-time, which obviously leads to the improvement of energy efficiency at run-time. We argue that energy efficiency can be achieved with: (1) minimised sensor network programming workload by forcing the folding of goals into the view partially; (2) reduced redundant computation with fewer computation steps at network nodes by forcing the unfolding of simple goals; (3) reduced inter-node message transmission by more specific addressing of messages to nodes; and (4) reduced memory requirements by specialising network-wide programs to smaller programs for specific nodes. A partial deduction system is developed and an extended example is provided to demonstrate the potential performance improvement of the technique.