Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahmad, Y., Cetintemel, U.: Network aware query processing for stream based applications. In: Proceedings of Very Large Data Bases (VLDB) (2004)
Banavar, G., Chandra, T., Mukherjee, B., Nagarajarao, J., Strom, R., Sturman, D.: An efficient multicast protocol for content based publish-subscribe systems. In: Proceedings of the international conference on distributed computing systems (1999)
Chen, J., Dewitt, D.: Dynamic regrouping of continuous queries. Technical report, University of Wisconsin-Madison (2002)
Chen, J., DeWitt, D., Naughton, J.: Design and evaluation of alternative selection placement strategies in optimizing continuous queries. In: ICDE, pp. 345–356 (2002)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)
Gkantsidis, C., Mihail, M., Zegura, E.: The markov chain simulation method for generating connected power law random graphs. In: ALENEX (2003)
Jin, Y., Strom, R.: Relational subscription middleware for internet-scale publish-subscribe. In: DEBS (2003)
Melançon, G., Philippe, F.: Generating connected acyclic digraphs uniformly at random. Information Processing Letters 90(4), 209–213 (2004)
Munagala, K., Babu, S., Motwani, R., Widom, J.: The pipelined set cover problem. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 83–98. Springer, Heidelberg (2004)
Pandit, V., Strom, R., Buttner, G., Ginis, R.: Performance modeling and placement of transforms for distributed stream processing. IBM Research Report (2006)
Plale, B., Schwan, K.: Dynamic querying of streaming data with the dquob system. IEEE Transactions on Parallel and Distributed Databases 14(4) (2003)
Rosenthal, A., Chakravarthy, U.: Anatomy of a modular multiple query optimizer. In: VLDB, pp. 230–239 (1988)
Roy, P.: Multiquery optimization and Applications. PhD thesis, IIT Bombay (2000)
Strom, R.: Extending a content based publish-subscribe system with relational subscriptions. Technical report, IBM Research (2003)
Sellis, T.: Multiple query optimization. ACM Transactions on database systems 10(3) (1986)
Srivastava, U., Munagala, K., Widom, J.: Operator placement for in-network stream query processing. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pandit, V., Ji, Hb. (2006). Efficient In-Network Evaluation of Multiple Queries. In: Robert, Y., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2006. HiPC 2006. Lecture Notes in Computer Science, vol 4297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945918_24
Download citation
DOI: https://doi.org/10.1007/11945918_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68039-0
Online ISBN: 978-3-540-68040-6
eBook Packages: Computer ScienceComputer Science (R0)