ACM Computing Surveys (CSUR)
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Gigascope: high performance network monitoring with an SQL interface
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Continuous queries over data streams
ACM SIGMOD Record
Continual Queries for Internet Scale Event-Driven Information Delivery
IEEE Transactions on Knowledge and Data Engineering
Scalable Management and Data Mining Using Astrolabe
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Towards Sensor Database Systems
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
Dynamic Querying of Streaming Data with the dQUOB System
IEEE Transactions on Parallel and Distributed Systems
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
GATES: A Grid-Based Middleware for Processing Distributed Data Streams
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Operator placement for in-network stream query processing
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Network-Aware Operator Placement for Stream-Processing Systems
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Reclaiming network-wide visibility using ubiquitous endsystem monitors
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Wide-scale data stream management
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Resource allocation strategies for constructive in-network stream processing
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Efficient in-network evaluation of multiple queries
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
| Hi-index | 0.00 |
This work investigates the operator mapping problem for in-network stream-processing. In a stream-processing application, a tree of operators is applied, in steady-state mode, to datasets that are continuously updated at different locations in the network. The goal is to generate updated final results at a desired rate. In in-network stream-processing, dataset updates and operator computations are performed by servers distributed in a network. We consider the problem of mapping operators to these servers in the case of multiple concurrent stream-processing applications. In this case, different operator trees corresponding to different applications may share common subtrees, so that intermediate results can be reused by different applications. This work provides complexity results for different versions of the operator mapping problem, which can be formulated as integer linear programs. Several polynomial-time heuristics are proposed for a particularly relevant version of the problem, which is NP-hard. These heuristics are compared and evaluated via simulation. The results demonstrate the importance of mapping the operators to appropriate processors, and the importance of sharing common sub-trees across operator trees.