Adaptive and Decentralized Operator Placement for In-Network Query Processing

Keyphrases

• In-network Computing 100%
• Operator Placement 100%
• Sensor Networks 50%
• Near-optimal 50%
• Polynomial-time Algorithm 50%
• Potential Gains 50%
• Sensor Data 50%
• Sensor Node 50%
• Network Traffic 50%
• Placement Strategy 50%
• Task Assignment Problem 50%
• Local Minima 50%
• Optimal Placement 50%
• Decentralized Algorithm 50%
• Neighbor Node 50%
• Adaptive Algorithm 50%
• Graph Topology 50%
• Query Operators 50%

Computer Science

• Query Processing 100%
• Polynomial Algorithm 50%
• Sensor Networks 50%
• Sensor Node 50%
• Topology Graph 50%
• Network Traffic 50%
• Potential Benefit 50%
• Transmitted Data 50%
• Assignment Problem 50%
• Local Minimum 50%