A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Anatomy of a Mudular Multiple Query Optimizer
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Dynamic Querying of Streaming Data with the dQUOB System
IEEE Transactions on Parallel and Distributed Systems
Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Relational subscription middleware for Internet-scale publish-subscribe
Proceedings of the 2nd international workshop on Distributed event-based systems
Generating connected acyclic digraphs uniformly at random
Information Processing Letters
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 query processing for stream-based applications
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
Resource allocation for multiple concurrent in-network stream-processing applications
Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
| Hi-index | 0.00 |
Recently, applications in which relational data is generated in a distributed and streaming manner have emerged from diverse domains. Processing queries on such data has become very important. In-network evaluation of a query is a technique in which the query is evaluated in the network without transferring all the data to a central location. So far, algorithms for in-network of evaluation of a single query have been proposed. They are not designed to exploit common computations across multiple queries. There is a need to develop techniques for efficient in-network evaluation of multiple queries. We consider the problem of in-network evaluation of multiple queries on relational data generated on a distributed network of machines. We present a novel algorithm based on an algorithm for dynamic regrouping of queries.