Adaptive and decentralized operator placement for in-network query processing

DOI10.1007/3-540-36978-3_4MaRDI QIDQ4424108zbMATH OpenFDO

Authors Boris Jan Bonfils, P. Bonnet

Publication date 9 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2634/26340047.htm, https://curis.ku.dk/ws/files/170193049/submitted.pdf

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Computing methodologies and applications (68U99)

Recommendations

• A novel distributed framework for optimizing query routing trees in wireless sensor networks via optimal operator placement
• Resource allocation strategies for constructive in-network stream processing
• Toward adaptive query processing in wireless sensor networks
• Adaptive processing of historical spatial range queries in peer-to-peer sensor networks
• Adaptive holistic scheduling for query processing in sensor networks

Cited in

(8)

• A novel distributed framework for optimizing query routing trees in wireless sensor networks via optimal operator placement
• TCEP: transitions in operator placement to adapt to dynamic network environments
• Resource allocation strategies for constructive in-network stream processing
• Scalable decentralized control for sensor networks via distributed lattices
• MDP for query-based wireless sensor networks
• Reasoning on the efficiency of distributed complex event processing
• Adaptive processing of historical spatial range queries in peer-to-peer sensor networks
• Toward adaptive query processing in wireless sensor networks

This page was built for publication: Adaptive and decentralized operator placement for in-network query processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4424108)