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. © 2006 Springer-Verlag.
CITATION STYLE
Pandit, V., & Ji, H. B. (2006). Efficient in-network evaluation of multiple queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4297 LNCS, pp. 205–216). https://doi.org/10.1007/11945918_24
Mendeley helps you to discover research relevant for your work.